AllPairsShortestPath[g] gives a matrix, where the (i, j)\[Null]^th entry is the length of a shortest path in g between vertices i and j. AllPairsShortestPath[g, Parent] ...
InversionPoset[n] returns a Hasse diagram of the partially ordered set on size-n permutations in which p < q if q can be obtained from p by an adjacent transposition that ...
Isomorphism[g, h] gives an isomorphism between graphs g and h if one exists. Isomorphism[g, h, All] gives all isomorphisms between graphs g and h. Isomorphism[g] gives the ...
NetworkFlow[g, source, sink] returns the value of a maximum flow through graph g from source to sink. NetworkFlow[g, source, sink, Edge] returns the edges in g that have ...
PartitionLattice[n] returns a Hasse diagram of the partially ordered set on set partitions of 1 through n in which p < q if q is finer than p, that is, each block in q is ...
Graphs provide great information visualization. Highlighting graph elements will let information stand out. By using algorithmic graph layouts, much of the structure in a ...
AiryAiZero[k] represents the k\[Null]^th zero of the Airy function Ai(x).AiryAiZero[k, x_0] represents the k\[Null]^th zero less than x_0.
BoxMatrix[r] gives a (2 r + 1)*(2 r + 1) matrix of 1s.BoxMatrix[r, w] gives a (2 r + 1)*(2 r + 1) block of 1s centered in a w*w matrix of 0s.BoxMatrix[{r_1, r_2, ...}, ...] ...
CayleyGraph[group] returns a Cayley graph representation of group.
DirectedGraphQ[g] yields True if the graph g is a directed graph and False otherwise.