StableMarriage[mpref, fpref] finds the male optimal stable marriage defined by lists of permutations describing male and female preferences.
WeightingFunction is an option to the functions SetEdgeWeights and SetVertexWeights that tells the functions how to compute edge weights and vertex weights, respectively.
WeightRange is an option to the functions SetEdgeWeights and SetVertexWeights that gives the range for these weights.
PageRanks[g] give the page rank of the graph g as a rule list.
GraphIntersection[g_1, g_2, ...] constructs the graph defined by the edges that are in all the graphs g_1, g_2, ....
GraphSum[g_1, g_2, ...] constructs the graph resulting from joining the edge lists of graphs g_1, g_2, and so forth.
MaximalBipartiteMatching[g] gives the maximal matching of the bipartite graph g.
ShortestPath[g, start, end] finds a shortest path between vertices start and end in graph g.
ShortestPathSpanningTree[g, v] constructs a shortest-path spanning tree rooted at v, so that a shortest path in graph g from v to any other vertex is a path in the tree.
EdgeIndex[g, e] gives the integer index for the edge e in the graph g.