addArc | HGraph.Directed, HGraph.Directed.AdjacencyMap |
addEdge | HGraph.Undirected, HGraph.Undirected.AdjacencyMap |
addVertex | |
1 (Function) | HGraph.Directed, HGraph.Directed.AdjacencyMap |
2 (Function) | HGraph.Undirected, HGraph.Undirected.AdjacencyMap |
Adjacency | |
1 (Type/Class) | HGraph.Directed, HGraph.Directed.AdjacencyMap |
2 (Type/Class) | HGraph.Undirected, HGraph.Undirected.AdjacencyMap |
allLinkages | HGraph.Directed.Connectivity |
allMaximalPaths | HGraph.Directed.Connectivity |
allPaths | HGraph.Directed.Connectivity |
ancestor | HGraph.Undirected.Solvers.Treedepth |
arcExists | HGraph.Directed, HGraph.Directed.AdjacencyMap |
arcs | HGraph.Directed, HGraph.Directed.AdjacencyMap |
atLeast | HGraph.Undirected.Solvers.IndependentSet |
children | HGraph.Undirected.Solvers.Treedepth |
completeGraph | HGraph.Undirected.Generator |
completeTree | HGraph.Undirected.Generator |
connectedComponents | HGraph.Undirected, HGraph.Undirected.AdjacencyMap |
contains | HGraph.Directed.Subgraph |
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 |
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 |
empty | |
1 (Function) | HGraph.Directed, HGraph.Directed.AdjacencyMap |
2 (Function) | HGraph.Undirected, HGraph.Undirected.AdjacencyMap |
emptyDigraph | HGraph.Directed.AdjacencyMap |
emptyGraph | HGraph.Undirected.AdjacencyMap |
everyEdge | HGraph.Directed.Output |
everyNode | HGraph.Directed.Output |
extendLinkage | HGraph.Directed.Connectivity.IntegralLinkage, HGraph.Directed.Connectivity |
Graph | HGraph.Undirected.AdjacencyMap |
graphName | HGraph.Directed.Output |
grid | HGraph.Undirected.Generator |
indegree | HGraph.Directed, HGraph.Directed.AdjacencyMap |
inducedSubgraph | HGraph.Undirected, HGraph.Undirected.AdjacencyMap |
inneighbors | HGraph.Directed, HGraph.Directed.AdjacencyMap |
isDecomposition | HGraph.Undirected.Solvers.Treedepth |
isSubgraphIsomorphism | HGraph.Directed.Subgraph |
isSubgraphOf | HGraph.Directed.Subgraph |
isVertex | HGraph.Directed, HGraph.Directed.AdjacencyMap |
liLinkage | HGraph.Directed.Connectivity.IntegralLinkage, HGraph.Directed.Connectivity |
linearizeVertices | |
1 (Function) | HGraph.Directed, HGraph.Directed.AdjacencyMap |
2 (Function) | HGraph.Undirected, HGraph.Undirected.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 |
maxDisjointPaths | HGraph.Directed.Connectivity.Flow, HGraph.Directed.Connectivity |
maxFlow | HGraph.Directed.Connectivity.Flow, HGraph.Directed.Connectivity |
maximize | HGraph.Undirected.Solvers.IndependentSet |
metaBfs | |
1 (Function) | HGraph.Directed, HGraph.Directed.AdjacencyMap |
2 (Function) | HGraph.Undirected, HGraph.Undirected.AdjacencyMap |
minCut | HGraph.Directed.Connectivity.Flow, HGraph.Directed.Connectivity |
minCutI | HGraph.Directed.Connectivity.Flow, HGraph.Directed.Connectivity |
minimumVertexCover | HGraph.Undirected.Solvers.VertexCover |
Mutable | |
1 (Type/Class) | HGraph.Directed, HGraph.Directed.AdjacencyMap |
2 (Type/Class) | HGraph.Undirected, HGraph.Undirected.AdjacencyMap |
neighbors | HGraph.Undirected, HGraph.Undirected.AdjacencyMap |
nodeAttributes | HGraph.Directed.Output |
numArcs | HGraph.Directed, HGraph.Directed.AdjacencyMap |
numEdges | HGraph.Undirected, HGraph.Undirected.AdjacencyMap |
numVertices | |
1 (Function) | HGraph.Directed, HGraph.Directed.AdjacencyMap |
2 (Function) | HGraph.Undirected, HGraph.Undirected.AdjacencyMap |
optimalDecomposition | HGraph.Undirected.Solvers.Treedepth |
outdegree | HGraph.Directed, HGraph.Directed.AdjacencyMap |
outneighbors | HGraph.Directed, HGraph.Directed.AdjacencyMap |
pathAnonymity | HGraph.Directed.PathAnonymity |
pathAnonymityCertificate | HGraph.Directed.PathAnonymity |
pathPathAnonymityI | HGraph.Directed.PathAnonymity |
positions | HGraph.Undirected.Layout.SpringModel |
randomGraph | HGraph.Undirected.Generator |
reachable | HGraph.Directed.Connectivity |
reduce | HGraph.Undirected.Solvers.IndependentSet |
removeArc | HGraph.Directed, HGraph.Directed.AdjacencyMap |
removeEdge | HGraph.Undirected, HGraph.Undirected.AdjacencyMap |
removeVertex | |
1 (Function) | HGraph.Directed, HGraph.Directed.AdjacencyMap |
2 (Function) | HGraph.Undirected, HGraph.Undirected.AdjacencyMap |
roots | HGraph.Undirected.Solvers.Treedepth |
setup | HGraph.Undirected.Layout.SpringModel |
step | HGraph.Undirected.Layout.SpringModel |
subgraphIsomorphism | HGraph.Directed.Subgraph |
subgraphIsomorphismI | HGraph.Directed.Subgraph |
toDot | |
1 (Function) | HGraph.Directed.Output |
2 (Function) | HGraph.Undirected.Output |
treedepthAtMost | HGraph.Undirected.Solvers.Treedepth |
UndirectedGraph | HGraph.Undirected, HGraph.Undirected.AdjacencyMap |
vertexCoverAtMost | HGraph.Undirected.Solvers.VertexCover |
vertexExpansion | HGraph.Undirected.Expanders |
vertices | |
1 (Function) | HGraph.Directed, HGraph.Directed.AdjacencyMap |
2 (Function) | HGraph.Undirected, HGraph.Undirected.AdjacencyMap |