| 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 |
| bCandidates | HGraph.Directed.Connectivity.OneWayWellLinkedness.Internal, HGraph.Directed.Connectivity.OneWayWellLinkedness |
| bidirectedCycle | HGraph.Directed.Generator |
| bSet | HGraph.Directed.Connectivity.OneWayWellLinkedness.Internal, HGraph.Directed.Connectivity.OneWayWellLinkedness |
| children | HGraph.Undirected.Solvers.Treedepth |
| choose | HGraph.Utils |
| completeGraph | HGraph.Undirected.Generator |
| completeTree | HGraph.Undirected.Generator |
| connectedComponents | HGraph.Undirected, HGraph.Undirected.AdjacencyMap |
| contains | HGraph.Directed.Subgraph |
| cuttableSubsetI | HGraph.Directed.Connectivity.Flow, HGraph.Directed.Connectivity |
| cycleGraph | HGraph.Undirected.Generator |
| Decomposition | |
| 1 (Type/Class) | HGraph.Undirected.Solvers.Treedepth |
| 2 (Data Constructor) | HGraph.Undirected.Solvers.Treedepth |
| defaultDotStyle | HGraph.Directed.Output |
| degree | HGraph.Undirected, HGraph.Undirected.AdjacencyMap |
| degreeSequence | HGraph.Directed.Generator.Hereditary.Internal |
| depth | HGraph.Undirected.Solvers.Treedepth |
| Digraph | HGraph.Directed.AdjacencyMap |
| DirectedGraph | HGraph.Directed, HGraph.Directed.AdjacencyMap |
| DotStyle | |
| 1 (Type/Class) | HGraph.Directed.Output |
| 2 (Data Constructor) | HGraph.Directed.Output |
| edgeAttributes | HGraph.Directed.Output |
| edgeExists | HGraph.Undirected, HGraph.Undirected.AdjacencyMap |
| edgeExpansion | HGraph.Undirected.Expanders |
| edges | HGraph.Undirected, HGraph.Undirected.AdjacencyMap |
| edgeWellLinkedPair | HGraph.Directed.Connectivity.OneWayWellLinkedness.Internal, HGraph.Directed.Connectivity.OneWayWellLinkedness |
| edgeWellLinkedPair' | HGraph.Directed.Connectivity.OneWayWellLinkedness.Internal, HGraph.Directed.Connectivity.OneWayWellLinkedness |
| empty | |
| 1 (Function) | HGraph.Undirected, HGraph.Undirected.AdjacencyMap |
| 2 (Function) | HGraph.Directed, HGraph.Directed.AdjacencyMap |
| emptyDigraph | HGraph.Directed.AdjacencyMap |
| emptyGraph | HGraph.Undirected.AdjacencyMap |
| enumerateParallel | HGraph.Directed.Generator.Hereditary.Internal, HGraph.Directed.Generator.Hereditary |
| enumerateParallel' | HGraph.Directed.Generator.Hereditary.Internal, HGraph.Directed.Generator.Hereditary |
| enumerateSubgraphs | HGraph.Directed.Subgraph |
| enumerateSubgraphsI | HGraph.Directed.Subgraph |
| everyEdge | HGraph.Directed.Output |
| everyNode | HGraph.Directed.Output |
| exhaust | HGraph.Directed.Generator.Hereditary.Internal, HGraph.Directed.Generator.Hereditary |
| extendLinkage | HGraph.Directed.Connectivity.IntegralLinkage, HGraph.Directed.Connectivity |
| findWellLinkedSetI | HGraph.Directed.Connectivity.Flow, HGraph.Directed.Connectivity |
| Fingerprint | |
| 1 (Type/Class) | HGraph.Directed.Generator.Hereditary.Internal |
| 2 (Data Constructor) | HGraph.Directed.Generator.Hereditary.Internal |
| fingerprint | HGraph.Directed.Generator.Hereditary.Internal |
| Graph | HGraph.Undirected.AdjacencyMap |
| graphName | HGraph.Directed.Output |
| grid | HGraph.Undirected.Generator |
| Guess | |
| 1 (Type/Class) | HGraph.Directed.Connectivity.OneWayWellLinkedness.Internal, HGraph.Directed.Connectivity.OneWayWellLinkedness |
| 2 (Data Constructor) | HGraph.Directed.Connectivity.OneWayWellLinkedness.Internal, HGraph.Directed.Connectivity.OneWayWellLinkedness |
| guessArc | |
| 1 (Function) | HGraph.Directed.EditDistance.Acyclic.ArcDeletion.Internal |
| 2 (Function) | HGraph.Directed.Packing.Cycles.Internal |
| guessOne | HGraph.Utils |
| incomingArcs | HGraph.Directed, HGraph.Directed.AdjacencyMap |
| indegree | HGraph.Directed, HGraph.Directed.AdjacencyMap |
| inducedSubgraph | |
| 1 (Function) | HGraph.Undirected, HGraph.Undirected.AdjacencyMap |
| 2 (Function) | HGraph.Directed, HGraph.Directed.AdjacencyMap |
| inneighbors | HGraph.Directed, HGraph.Directed.AdjacencyMap |
| insertNewDigraph | HGraph.Directed.Generator.Hereditary.Internal |
| isDecomposition | HGraph.Undirected.Solvers.Treedepth |
| isIsomorphicTo | HGraph.Directed, HGraph.Directed.AdjacencyMap |
| isIsomorphicToI | HGraph.Directed, HGraph.Directed.AdjacencyMap |
| isMinorEmbedding | HGraph.Directed.TopologicalMinor |
| isMinorOf | HGraph.Directed.TopologicalMinor |
| isMinorOfI | HGraph.Directed.TopologicalMinor |
| isSubgraphIsomorphism | HGraph.Directed.Subgraph |
| isSubgraphOf | HGraph.Directed.Subgraph |
| isVertex | HGraph.Directed, HGraph.Directed.AdjacencyMap |
| isWellLinkedTo | HGraph.Directed.Connectivity.Flow, HGraph.Directed.Connectivity |
| liLinkage | HGraph.Directed.Connectivity.IntegralLinkage, HGraph.Directed.Connectivity |
| linearizeVertices | |
| 1 (Function) | HGraph.Undirected, HGraph.Undirected.AdjacencyMap |
| 2 (Function) | HGraph.Directed, HGraph.Directed.AdjacencyMap |
| lineDigraphI | HGraph.Directed, HGraph.Directed.AdjacencyMap |
| linkage | HGraph.Directed.Connectivity.IntegralLinkage, HGraph.Directed.Connectivity |
| linkageI | HGraph.Directed.Connectivity.IntegralLinkage, HGraph.Directed.Connectivity |
| LinkageInstance | |
| 1 (Type/Class) | HGraph.Directed.Connectivity.IntegralLinkage, HGraph.Directed.Connectivity |
| 2 (Data Constructor) | HGraph.Directed.Connectivity.IntegralLinkage, HGraph.Directed.Connectivity |
| liPath | HGraph.Directed.Connectivity.IntegralLinkage, HGraph.Directed.Connectivity |
| liTerminalPairs | HGraph.Directed.Connectivity.IntegralLinkage, HGraph.Directed.Connectivity |
| loadDot | |
| 1 (Function) | HGraph.Undirected.Load |
| 2 (Function) | HGraph.Directed.Load |
| loadEdgeList | HGraph.Directed.Load |
| maxArcDisjointPaths | HGraph.Directed.Connectivity.Flow, HGraph.Directed.Connectivity |
| maxDisjointPaths | HGraph.Directed.Connectivity.Flow, HGraph.Directed.Connectivity |
| maxFlow | HGraph.Directed.Connectivity.Flow, HGraph.Directed.Connectivity |
| maxFlowValue | HGraph.Directed.Connectivity.Flow, HGraph.Directed.Connectivity |
| maximize | HGraph.Undirected.Solvers.IndependentSet |
| maximum | HGraph.Directed.Packing.Cycles.Internal, HGraph.Directed.Packing.Cycles |
| maximumI | HGraph.Directed.Packing.Cycles.Internal, HGraph.Directed.Packing.Cycles |
| maximumI' | HGraph.Directed.Packing.Cycles.Internal |
| maximumIWeak | HGraph.Directed.Packing.Cycles.Internal |
| metaBfs | |
| 1 (Function) | HGraph.Undirected, HGraph.Undirected.AdjacencyMap |
| 2 (Function) | HGraph.Directed, HGraph.Directed.AdjacencyMap |
| mhead | HGraph.Utils |
| minCut | HGraph.Directed.Connectivity.Flow, HGraph.Directed.Connectivity |
| minCutI | HGraph.Directed.Connectivity.Flow, HGraph.Directed.Connectivity |
| minimum | |
| 1 (Function) | HGraph.Directed.EditDistance.Acyclic.VertexDeletion.Internal, HGraph.Directed.EditDistance.Acyclic.VertexDeletion |
| 2 (Function) | HGraph.Directed.EditDistance.Acyclic.ArcDeletion.Internal, HGraph.Directed.EditDistance.Acyclic.ArcDeletion |
| minimumI | |
| 1 (Function) | HGraph.Directed.EditDistance.Acyclic.VertexDeletion.Internal, HGraph.Directed.EditDistance.Acyclic.VertexDeletion |
| 2 (Function) | HGraph.Directed.EditDistance.Acyclic.ArcDeletion.Internal, HGraph.Directed.EditDistance.Acyclic.ArcDeletion |
| minimumI' | HGraph.Directed.EditDistance.Acyclic.VertexDeletion.Internal |
| minimumIComponents | |
| 1 (Function) | HGraph.Directed.EditDistance.Acyclic.VertexDeletion.Internal |
| 2 (Function) | HGraph.Directed.EditDistance.Acyclic.ArcDeletion.Internal |
| minimumVertexCover | HGraph.Undirected.Solvers.VertexCover |
| Mutable | |
| 1 (Type/Class) | HGraph.Undirected, HGraph.Undirected.AdjacencyMap |
| 2 (Type/Class) | HGraph.Directed, HGraph.Directed.AdjacencyMap |
| neighbors | HGraph.Undirected, HGraph.Undirected.AdjacencyMap |
| nodeAttributes | HGraph.Directed.Output |
| numArcs | HGraph.Directed, HGraph.Directed.AdjacencyMap |
| numberOfVertices | HGraph.Directed.Connectivity.OneWayWellLinkedness.Internal, HGraph.Directed.Connectivity.OneWayWellLinkedness |
| numEdges | HGraph.Undirected, HGraph.Undirected.AdjacencyMap |
| numVertices | |
| 1 (Function) | HGraph.Undirected, HGraph.Undirected.AdjacencyMap |
| 2 (Function) | HGraph.Directed, HGraph.Directed.AdjacencyMap |
| oneWayGrid | HGraph.Directed.Generator |
| optimalDecomposition | HGraph.Undirected.Solvers.Treedepth |
| outdegree | HGraph.Directed, HGraph.Directed.AdjacencyMap |
| outgoingArcs | HGraph.Directed, HGraph.Directed.AdjacencyMap |
| outneighbors | HGraph.Directed, HGraph.Directed.AdjacencyMap |
| packArc | HGraph.Directed.Packing.Cycles.Internal |
| pathAnonymity | HGraph.Directed.PathAnonymity |
| pathAnonymityCertificate | HGraph.Directed.PathAnonymity |
| pathPathAnonymityI | HGraph.Directed.PathAnonymity |
| positions | HGraph.Undirected.Layout.SpringModel |
| processJobList | HGraph.Parallel |
| produceConsumeExhaustive | HGraph.Parallel |
| random | HGraph.Directed.Generator.Hereditary.Internal, HGraph.Directed.Generator.Hereditary |
| randomAcyclicDigraph | HGraph.Directed.Generator |
| randomDigraph | HGraph.Directed.Generator |
| randomGraph | HGraph.Undirected.Generator |
| randomN | HGraph.Utils |
| randomTree | HGraph.Undirected.Generator |
| reach | HGraph.Directed.Connectivity.Basic, HGraph.Directed.Connectivity |
| reachable | HGraph.Directed.Connectivity.Basic, HGraph.Directed.Connectivity |
| reduce | HGraph.Undirected.Solvers.IndependentSet |
| removeArc | HGraph.Directed, HGraph.Directed.AdjacencyMap |
| removeEdge | HGraph.Undirected, HGraph.Undirected.AdjacencyMap |
| removeVertex | |
| 1 (Function) | HGraph.Undirected, HGraph.Undirected.AdjacencyMap |
| 2 (Function) | HGraph.Directed, HGraph.Directed.AdjacencyMap |
| renameVertices | HGraph.Directed, HGraph.Directed.AdjacencyMap |
| restrictACandidates | HGraph.Directed.Connectivity.OneWayWellLinkedness.Internal |
| restrictBCandidates | HGraph.Directed.Connectivity.OneWayWellLinkedness.Internal |
| reverseReach | HGraph.Directed.Connectivity.Basic, HGraph.Directed.Connectivity |
| roots | HGraph.Undirected.Solvers.Treedepth |
| separableSets | HGraph.Directed.Connectivity.Flow, HGraph.Directed.Connectivity |
| separableSetsI | HGraph.Directed.Connectivity.Flow, HGraph.Directed.Connectivity |
| separateVertices | HGraph.Directed.EditDistance.Acyclic.ArcDeletion.Internal |
| separateVertices' | HGraph.Directed.EditDistance.Acyclic.ArcDeletion.Internal |
| setup | HGraph.Undirected.Layout.SpringModel |
| splitVertices | HGraph.Directed, HGraph.Directed.AdjacencyMap |
| step | HGraph.Undirected.Layout.SpringModel |
| strongComponents | HGraph.Directed.Connectivity.Basic, HGraph.Directed.Connectivity |
| subgraphAround | HGraph.Directed, HGraph.Directed.AdjacencyMap |
| subgraphIsomorphism | HGraph.Directed.Subgraph |
| subgraphIsomorphismI | HGraph.Directed.Subgraph |
| toDot | |
| 1 (Function) | HGraph.Undirected.Output |
| 2 (Function) | HGraph.Directed.Output |
| topologicalMinor | HGraph.Directed.TopologicalMinor |
| topologicalMinorI | HGraph.Directed.TopologicalMinor |
| topologicalOrdering | HGraph.Directed, HGraph.Directed.AdjacencyMap |
| transitiveClosure | HGraph.Directed, HGraph.Directed.AdjacencyMap |
| treedepthAtMost | HGraph.Undirected.Solvers.Treedepth |
| UndirectedGraph | HGraph.Undirected, HGraph.Undirected.AdjacencyMap |
| union | HGraph.Directed, HGraph.Directed.AdjacencyMap |
| vertexCoverAtMost | HGraph.Undirected.Solvers.VertexCover |
| vertexExpansion | HGraph.Undirected.Expanders |
| vertexWellLinkedPair | HGraph.Directed.Connectivity.OneWayWellLinkedness.Internal, HGraph.Directed.Connectivity.OneWayWellLinkedness |
| vertices | |
| 1 (Function) | HGraph.Undirected, HGraph.Undirected.AdjacencyMap |
| 2 (Function) | HGraph.Directed, HGraph.Directed.AdjacencyMap |