GraphCoordinates (Graph Utilities Package Symbol)

GraphCoordinates[g, options] calculates a visually appealing 2D layout of the vertices of the graph g and returns the coordinates of the vertices.

GraphDistanceMatrix (Graph Utilities Package Symbol)

GraphDistanceMatrix[g] gives a matrix in which the (i, j)\[Null]^th entry is the length of a shortest path in g between vertices i and j.GraphDistanceMatrix[g, Parent] ...

GraphDistance (Graph Utilities Package Symbol)

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

GraphEdit (Graph Utilities Package Symbol)

GraphEdit[] opens an interactive graph editor.GraphEdit[g] plots the graph g in the interactive graph editor.

GraphPath (Graph Utilities Package Symbol)

GraphPath[g, start, end] finds a shortest path between vertices start and end in 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.