| aCandidates | HGraph.Directed.Connectivity.OneWayWellLinkedness.Internal, HGraph.Directed.Connectivity.OneWayWellLinkedness |
| addArc | HGraph.Directed, HGraph.Directed.AdjacencyMap |
| addAVertex | HGraph.Directed.Connectivity.OneWayWellLinkedness.Internal |
| addBVertex | HGraph.Directed.Connectivity.OneWayWellLinkedness.Internal |
| addEdge | HGraph.Undirected, HGraph.Undirected.AdjacencyMap |
| addVertex | |
| 1 (Function) | HGraph.Undirected, HGraph.Undirected.AdjacencyMap |
| 2 (Function) | HGraph.Directed, HGraph.Directed.AdjacencyMap |
| Adjacency | |
| 1 (Type/Class) | HGraph.Undirected, HGraph.Undirected.AdjacencyMap |
| 2 (Type/Class) | HGraph.Directed, HGraph.Directed.AdjacencyMap |
| allLinkages | HGraph.Directed.Connectivity.Basic, HGraph.Directed.Connectivity |
| allMaximalPaths | HGraph.Directed.Connectivity.Basic, HGraph.Directed.Connectivity |
| allPaths | HGraph.Directed.Connectivity.Basic, HGraph.Directed.Connectivity |
| ancestor | HGraph.Undirected.Solvers.Treedepth |
| arcExists | HGraph.Directed, HGraph.Directed.AdjacencyMap |
| arcMaximumI | HGraph.Directed.Packing.Cycles.Internal, HGraph.Directed.Packing.Cycles |
| arcs | HGraph.Directed, HGraph.Directed.AdjacencyMap |
| aSet | HGraph.Directed.Connectivity.OneWayWellLinkedness.Internal, HGraph.Directed.Connectivity.OneWayWellLinkedness |
| atLeast | HGraph.Undirected.Solvers.IndependentSet |