lib:hgraph

Modules

• HGraph.Directed
• HGraph.Directed.AdjacencyMap
• HGraph.Directed.Connectivity
• HGraph.Directed.Connectivity.Flow
• HGraph.Directed.Connectivity.IntegralLinkage
• HGraph.Directed.Load
• HGraph.Directed.Output
• HGraph.Directed.PathAnonymity
• HGraph.Directed.Subgraph
• HGraph.Undirected
• HGraph.Undirected.AdjacencyMap
• HGraph.Undirected.Expanders
• HGraph.Undirected.Generator
• HGraph.Undirected.Layout.SpringModel
• HGraph.Undirected.Load
• HGraph.Undirected.Output
• HGraph.Undirected.Solvers.IndependentSet
• HGraph.Undirected.Solvers.Treedepth
• HGraph.Undirected.Solvers.VertexCover

Dependencies

• array lib:array >=0.5
• base lib:base >=4.11 && <5
• containers lib:containers >=0.5
• happy-dot lib:happy-dot >=0.1
• linear lib:linear >=1.21
• mtl lib:mtl >=0
• random lib:random >=0
• transformers lib:transformers >=0.5

Reverse dependencies

Direct only. Not exhaustive.

• hgraph bench:bench-vertex-cover
• hgraph bench:benchmark-arc-deletion-acyclic
• hgraph bench:benchmark-packing-cycles
• hgraph test:test-adjacency-map
• hgraph test:test-connectivity
• hgraph test:test-digraph-generator
• hgraph test:test-directed-adjacency-map
• hgraph test:test-edit-distance-acyclic
• hgraph test:test-load
• hgraph test:test-packing-cycles
• hgraph test:test-path-anonymity
• hgraph test:test-subgraph
• hgraph test:test-topological-minor
• hgraph test:test-treedepth
• hgraph test:test-vertex-cover