Uses of Package
org.graph4j.util

Packages that use org.graph4j.util

Package	Description
org.graph4j	The main interfaces and classes for representing and using graphs.
org.graph4j.clique	Clique related algorithms, such as enumerating all maximal cliques of a graph.
org.graph4j.coloring
org.graph4j.coloring.bw	Algorithms for the bandwith graph coloring problem.
org.graph4j.connectivity	Algorithms for analyzing connectivity of graphs and digraphs.
org.graph4j.eulerian	Algorithms for determining eulerian circuits and trails.
org.graph4j.flow	Algorithms related to flows in transportation networks.
org.graph4j.generators	Graph generators of various kinds.
org.graph4j.hamiltonian
org.graph4j.isomorphism	Algorithms for testing graph isomorphism.
org.graph4j.matching	Algorithms for determining matchings, such as the maximum cardinality matching in bipartite graphs.
org.graph4j.metrics	Classes responsible with calculating various graph metrics (girth, radius, diameter, etc.).
org.graph4j.route	Algorithms related to paths and cycles.
org.graph4j.shortestpath	Algorithms related to shortest paths, such as Dijkstra, Bellman-Ford, Floyd-Warshall, etc.
org.graph4j.spanning	Minimum spanning tree algorithms, such as Prim's and Kruskal's.
org.graph4j.support	Support algorithms for various type of graphs (bipartite, tournament, etc.).
org.graph4j.traversal	Implementations of the depth-first search (DFS) and breadth-first search (BFS) algorithms, using both iterator and visitor patterns.
org.graph4j.util	Utility classes, such as apecialized collection for vertices and edges.
org.graph4j.vsp	Algorithms for the Vertex Separator Problem (VSP).

Classes in org.graph4j.util used by org.graph4j

Class	Description
VertexCollection	A collection of vertices in a graph.
VertexSet	A set of vertices of a graph.

Classes in org.graph4j.util used by org.graph4j.clique

Class	Description
Clique	A clique is a set of vertices of a graph such that any two of them are adjacent.

Classes in org.graph4j.util used by org.graph4j.coloring

Class	Description
Clique	A clique is a set of vertices of a graph such that any two of them are adjacent.
Domain	A domain of available non-negative values for a vertex.
VertexSet	A set of vertices of a graph.

Classes in org.graph4j.util used by org.graph4j.coloring.bw

Class	Description
Domain	A domain of available non-negative values for a vertex.

Classes in org.graph4j.util used by org.graph4j.connectivity

Class	Description
Block	A block of a graph is a maximal 2-connected subgraph (it has no cut vertex).
EdgeSet	A set of edges in a graph.
Path	A path is a trail with no duplicate vertices.
VertexSet	A set of vertices of a graph.

Classes in org.graph4j.util used by org.graph4j.eulerian

Class	Description
Circuit	A circuit is a trail whose last vertex is connected to the first one.
Trail	A trail is a walk with no repeated edge.

Classes in org.graph4j.util used by org.graph4j.flow

Class	Description
EdgeSet	A set of edges in a graph.
VertexQueue	A queue of vertices of a graph.
VertexSet	A set of vertices of a graph.

Classes in org.graph4j.util used by org.graph4j.generators

Class	Description
Cycle	A cycle is a closed path, meaning that the last vertex of the path is connected to the first one.
StableSet	A stable set is a set of vertices of a graph, no two of which are adjacent.
WorkInProgress

Classes in org.graph4j.util used by org.graph4j.hamiltonian

Class	Description
Cycle	A cycle is a closed path, meaning that the last vertex of the path is connected to the first one.
Path	A path is a trail with no duplicate vertices.

Classes in org.graph4j.util used by org.graph4j.isomorphism

Class	Description
RootedTree	Utility class representing a tree with a node designated as root.
VertexSet	A set of vertices of a graph.

Classes in org.graph4j.util used by org.graph4j.matching

Class	Description
Matching	A matching or independent edge set is a set of edges without common vertices.
StableSet	A stable set is a set of vertices of a graph, no two of which are adjacent.
VertexSet	A set of vertices of a graph.

Classes in org.graph4j.util used by org.graph4j.metrics

Class	Description
VertexSet	A set of vertices of a graph.

Classes in org.graph4j.util used by org.graph4j.route

Class	Description
Cycle	A cycle is a closed path, meaning that the last vertex of the path is connected to the first one.
Path	A path is a trail with no duplicate vertices.

Classes in org.graph4j.util used by org.graph4j.shortestpath

Class	Description
Cycle	A cycle is a closed path, meaning that the last vertex of the path is connected to the first one.
Path	A path is a trail with no duplicate vertices.

Classes in org.graph4j.util used by org.graph4j.spanning

Class	Description
EdgeSet	A set of edges in a graph.
UnionFind	A union-find data structure (also called disjoint-set or merge–find) stores a collection of disjoint (non-overlapping) sets.

Classes in org.graph4j.util used by org.graph4j.support

Class	Description
Clique	A clique is a set of vertices of a graph such that any two of them are adjacent.
Cycle	A cycle is a closed path, meaning that the last vertex of the path is connected to the first one.
Matching	A matching or independent edge set is a set of edges without common vertices.
Path	A path is a trail with no duplicate vertices.
StableSet	A stable set is a set of vertices of a graph, no two of which are adjacent.
VertexSet	A set of vertices of a graph.

Classes in org.graph4j.util used by org.graph4j.traversal

Class	Description
IntIterator	An iterator over a collection of primitive integers.

Classes in org.graph4j.util used by org.graph4j.util

Class	Description
Circuit	A circuit is a trail whose last vertex is connected to the first one.
Clique	A clique is a set of vertices of a graph such that any two of them are adjacent.
Domain	A domain of available non-negative values for a vertex.
IntComparator
IntHashMap	Adapted after the implementation of IntHashMap in Apache Commons Collection.
Parity
Path	A path is a trail with no duplicate vertices.
SortingAlgorithm
Trail	A trail is a walk with no repeated edge.
VertexCollection	A collection of vertices in a graph.
VertexList	A list of vertices of a graph.
VertexSet	A set of vertices of a graph.
Walk	A walk is a sequence of graph vertices such that any two consecutive vertices form an edge of the graph.

Classes in org.graph4j.util used by org.graph4j.vsp

Class	Description
VertexSet	A set of vertices of a graph.