graph
Provides constant-time access for successor and predecessor edges of a node.
Provides constant-time access for successor and predecessor edges of a node.
The constructor is O(n + a ln(n))
v0.2.1
Provides constant-time access for successor and predecessor edges of a node.
Provides constant-time access for successor and predecessor edges of a node.
The constructor is O(n + a ln(n))
v0.1.0
Provides constant-time access for edges of a node.
Provides constant-time access for edges of a node.
The constructor is O(n + a ln(n))
v0.2.1
Provides constant-time access for edges of a node.
Provides constant-time access for edges of a node.
The constructor is O(n + a ln(n))
v0.2.1
A graph with directed zero or one edges from any single node to any other single node.
A graph with directed zero or one edges from any single node to any other single node.
v0.1.0
Ancestor trait for a variety of Graphs.
Ancestor trait for a variety of Graphs.
A graph with Nodes that can be distinguished from each other. An InnerNodeType provides access to a nodes place in the graph.
I've pulled definitions from Wikipedia: http://en.wikipedia.org/wiki/Graph_(mathematics) where possible
v0.1.0
A graph that exposes the indices of stored nodes.
A graph that exposes the indices of stored nodes.
Implementers should also include some accessor for edges via indexes.
v0.2.1
A digraph that exposes the indices of stored nodes.
A digraph that exposes the indices of stored nodes.
v0.1.0
A digraph that exposes the indices of stored nodes.
v0.1.0
A digraph that exposes the indices of stored nodes.
A directed graph with labeled edges.
A directed graph with labeled edges.
v0.1.0
A directed graph with labeled edges.
A directed graph with labeled edges.
v0.2.1
A pair of interchangable nodes, often used in Undigraph.
A pair of interchangable nodes, often used in Undigraph. Order of the nodes doesn't matter.
v0.2.1
A directed graph with edges expressed as Tuple2s so that you can create edges with "a->b" in your code.
A directed graph with edges expressed as Tuple2s so that you can create edges with "a->b" in your code.
v0.2.1
A graph with undirected zero or one edges between any pair of nodes.
A graph with undirected zero or one edges between any pair of nodes.
v0.2.1
O(n ln(n) + e ln(n))
O(n ln(n) + e ln(n))
O(n ln(n) + e ln(n))
Create various types of graphs.
Create various types of graphs.
v0.1.0
Semirings and semiring-based graph minimizing algorithms.
Semirings and semiring-based graph minimizing algorithms.
SemiringSupport is the primary trait. Algorithms in this package -- Floyd-Warshall, Dijkstra's, and Brandes' algorithms -- use your choice of SemiringSupport to determine just what they are minimizing. The package also includes some common SemiringSupport implementations.
v0.1.0
Representations of various kinds of graphs. The top level, Graph, holds a Set of Nodes and a second collection of things that relate the nodes to each other -- the edges. Subtraits add features to these, and concrete implementations fill in with code tuned to particular uses.
Where possible, I use definitions from Wikipedia -- http://en.wikipedia.org/wiki/Graph_(mathematics)
I've left room in the hierarchy for a variety of kinds of graphs, but have only created the concrete classes I have real reasons to use. Please let me know if you need something specific.
v0.1.0