Long the standard for high-quality function and surface visualization, Mathematica incorporates a host of original numeric, symbolic, and geometric algorithms that automate ...
DepthFirstScan[g, s, {"event_1" -> f_1, "event_2" -> f_2, ...}] performs a depth-first scan of the graph g starting at the vertex s and evaluates f_i whenever "event_i" ...
CommunityStructurePartition[g] gives the partition of a graph g into communities.
HamiltonianGraphQ[g] yields True if the graph g is Hamiltonian, and False otherwise.
WattsStrogatzGraphDistribution[n, p] represents the Watts\[Dash]Strogatz graph distribution for n-vertex graphs with rewiring probability p.WattsStrogatzGraphDistribution[n, ...
CommunityStructureAssignment[g] gives the assignment of vertices of a graph g into communities.
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[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[g, i, j] gives the distance from vertex i to vertex j in the graph g.
CommunityModularity[g, partition] gives the community modularity of a partition.CommunityModularity[g, assignment] gives the community modularity of an assignment.