GraphDistance (Built-in Mathematica Symbol)

GraphDistance[g, s, t] gives the distance from source vertex s to target vertex t in the graph g.GraphDistance[g, s] gives the distance from s to all vertices of the graph g.

PriceGraphDistribution (Built-in Mathematica Symbol)

PriceGraphDistribution[n, k, a] represents a de Solla Price graph distribution for n-vertex graphs where a new vertex with k edges is added at each step using attractiveness ...

GraphDistance (Graph Utilities Package Symbol)

GraphDistance[g, i, j] gives the distance from vertex i to vertex j in the graph g.

CommunityModularity (Graph Utilities Package Symbol)

CommunityModularity[g, partition] gives the community modularity of a partition.CommunityModularity[g, assignment] gives the community modularity of an assignment.

GraphPath (Graph Utilities Package Symbol)

GraphPath[g, start, end] finds a shortest path between vertices start and end in graph g.

WeakComponents (Graph Utilities Package Symbol)

WeakComponents[g] gives a list of all weakly connected components in the undirected graph g.

ConnectedComponents (Built-in Mathematica Symbol)

ConnectedComponents[g] gives the connected components of the graph g.ConnectedComponents[g, {v_1, v_2, ...}] gives the connected components that include at least one of the ...

BreadthFirstScan (Built-in Mathematica Symbol)

BreadthFirstScan[g, s, {"event_1" -> f_1, "event_2" -> f_2, ...}] performs a breadth-first scan (bfs) of the graph g starting at the vertex s and evaluates f_i whenever ...

AdjacencyGraph (Built-in Mathematica Symbol)

AdjacencyGraph[amat] gives the graph with adjacency matrix amat.AdjacencyGraph[{v_1, v_2, ...}, amat] gives the graph with vertices v_i and adjacency matrix amat.

RandomGraph (Built-in Mathematica Symbol)

RandomGraph[{n, m}] gives a pseudorandom graph with n vertices and m edges.RandomGraph[{n, m}, k] gives a list of k pseudorandom graphs.RandomGraph[gdist, ...] samples from ...