All Classes and Interfaces

Classes
Class
Description
Java façade for connected-components analysis on undirected graphs.
A mutable façade over Gryphon's purely functional disjoint-set implementations, providing a Java-idiomatic API for connectivity queries.
Represents an unweighted directed or undirected edge between two vertices.
A mutable, lazily-materialised façade over Gryphon's purely functional graph types.
Java façade for minimum spanning tree algorithms on weighted undirected graphs.
Java façade for shortest-path algorithms on weighted directed graphs.
Java façade for strongly-connected-components analysis on directed graphs, using Kosaraju's two-pass algorithm.
Java façade for topological sorting of directed acyclic graphs (DAGs).
Represents a weighted edge between two vertices, carrying an attribute of type E.
A mutable, lazily-materialised façade over Gryphon's purely functional graph types, with a typed edge attribute E.