AntiSymmetricQ[g] yields True if the adjacency matrix of g represents an anti-symmetric binary relation.

Approximate is a value that the option Algorithm can take in calls to functions such as VertexCover, telling it to use an approximation algorithm.

ApproximateVertexCover[g] produces a vertex cover of graph g whose size is guaranteed to be within twice the optimal size.

ArticulationVertices[g] gives a list of all articulation vertices in graph g. These are vertices whose removal will disconnect the graph.

Automorphisms[g] gives the automorphism group of the graph g.

Backtrack[s, partialQ, solutionQ] performs a backtrack search of the state space s, expanding a partial solution so long as partialQ is True and returning the first complete ...

BellmanFord[g, v] gives a shortest-path spanning tree and associated distances from vertex v of graph g. The shortest-path spanning tree is given by a list in which element i ...

BiconnectedComponents[g] gives a list of the biconnected components of graph g. If g is directed, the underlying undirected graph is used.

BiconnectedQ[g] yields True if graph g is biconnected. If g is directed, the underlying undirected graph is used.

BinarySearch[l, k] searches sorted list l for key k and gives the position of l containing k, if k is present in l. Otherwise, if k is absent in l, the function returns (p + ...