- Watts-Strogatz Graphs
- It is a model that produces graphs with small-world properties.
- Elements are removed in the same order they were entered.
- Breadth-First Search
- Starting from the root node this algorithm explore all of the neighbor nodes at the current level before moving on to the nodes at the next level.
- Depth-First Search
- Starting from the root node this algorithm will explore all the way down a branch and then backtrack.
- Ring Lattice
- A type of regular graph that Watts and Strogatz used as the basis of their model.
- Regular Graphs
- This graph has the same number of neighbors.
- Measure of cliquishness of the graph.
- Path Length
- Measure of the average distance between two nodes.
- A set of nodes that are completely connected.
- Generative Model
- Modeling the process that builds or leads to the phenomenon to try and explain a phenomenon.
- The number of neighbors.
- Clustering Coefficient
- The measure of the degree to which nodes tend to cluster together in a graph.
- Dijkstra's Algorithm
- In this algorithm we find the minimum distance from a given node to every other node in the graph.
You have attempted of activities on this page