CommunityStructureAssignment (Graph Utilities Package Symbol)

CommunityStructureAssignment[g] gives the assignment of vertices of a graph g into communities.

CommunityStructurePartition (Graph Utilities Package Symbol)

CommunityStructurePartition[g] gives the partition of a graph g into communities.

ExpressionTreePlot (Graph Utilities Package Symbol)

ExpressionTree[e] plots the expression tree of e.ExpressionTreePlot[e, pos] plots the expression tree of e with its root placed at position pos.ExpressionTreePlot[e, pos, ...

FindHamiltonianCycle (Graph Utilities Package Symbol)

FindHamiltonianCycle[g] attempts to find a Hamiltonian cycle.

GraphDistance (Graph Utilities Package Symbol)

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

HamiltonianCycles (Graph Utilities Package Symbol)

HamiltonianCycles[g, n] gives a list of n Hamiltonian cycles.HamiltonianCycles[g] gives a list of one Hamiltonian cycle.

LineScaledCoordinate (Graph Utilities Package Symbol)

LineScaledCoordinate[{{x_1, y_1}, {x_2, y_2}, ..., {x_k, y_k}}, r] gives the coordinate of a point in the polyline {{x_1, y_1}, {x_2, y_2}, ..., {x_k, y_k}}, at a scaled ...

LinkRankMatrix (Graph Utilities Package Symbol)

LinkRankMatrix[g] returns the link rank of the graph g, in the form of a sparse matrix. The link rank of an edge u -> v is defined as the PageRanks of u, divided by the ...

LinkRanks (Graph Utilities Package Symbol)

LinkRanks[g] gives the link ranks of the directed graph g as a rule list.

MaximalBipartiteMatching (Graph Utilities Package Symbol)

MaximalBipartiteMatching[g] gives the maximal matching of the bipartite graph g.