Uses of Class
org.graph4j.GraphAlgorithm

Packages that use GraphAlgorithm

Package	Description
org.graph4j.connectivity	Algorithms for analyzing connectivity of graphs and digraphs.
org.graph4j.eulerian	Algorithms for determining eulerian circuits and trails.
org.graph4j.hamiltonian
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.ordering	Algorithms that produce various orderings of the vertices of a graph.
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.

Uses of GraphAlgorithm in org.graph4j.connectivity

Subclasses of GraphAlgorithm in org.graph4j.connectivity

Modifier and Type	Class	Description
class	EdgeConnectivityAlgorithm	Determines a maximum size set of edge disjoint paths between two vertices, a minimum size set of edges whose removal disconnects two vertices, the minimum cardinality edge cut and the edge connectivity number.
class	VertexConnectivityAlgorithm	Determines a maximum size set of vertex disjoint paths between two vertices, a minimum size set of vertices whose removal disconnects two vertices, the vertex connectivity number.

Uses of GraphAlgorithm in org.graph4j.eulerian

Subclasses of GraphAlgorithm in org.graph4j.eulerian

Modifier and Type	Class	Description
class	EulerianCircuitAlgorithmBase
class	HierholzerEulerianCircuit
class	HierholzerEulerianTrail	An Eulerian trail is a trail visits every edge exactly once.

Uses of GraphAlgorithm in org.graph4j.hamiltonian

Subclasses of GraphAlgorithm in org.graph4j.hamiltonian

Modifier and Type	Class	Description
class	BacktrackLongestPathAlgoritm	Backtracking algorithm for determining the longest path in a graph (directed or not).

Uses of GraphAlgorithm in org.graph4j.matching

Subclasses of GraphAlgorithm in org.graph4j.matching

Modifier and Type	Class	Description
class	GreedyWeightedMatching	Greedy algorithm to create a weighted matching.
class	MaximalCardinalityMatching	Creates a maximal cardinality matching either randomly or using a simple heuristic.

Uses of GraphAlgorithm in org.graph4j.metrics

Subclasses of GraphAlgorithm in org.graph4j.metrics

Modifier and Type	Class	Description
class	GraphMetrics	Various distances related to a graph.
class	TreeExtremaCalculator	Determines the diameter, radius, center and periphery for unweighted, undirected trees.
class	TreeMetrics	Various distances related to a tree.

Uses of GraphAlgorithm in org.graph4j.ordering

Subclasses of GraphAlgorithm in org.graph4j.ordering

Modifier and Type	Class	Description
class	SmallestDegreeLastOrdering	Computes the vertex ordering from the end to the beginning.

Uses of GraphAlgorithm in org.graph4j.route

Subclasses of GraphAlgorithm in org.graph4j.route

Modifier and Type	Class	Description
class	CycleFinder	Algorithms for finding cycles in a directed or undirected graph.
class	MaximumInducedPath	Computes the maximum induced path.
class	PathFinder	Algorithms for finding paths in unweighted directed or undirected graph.

Uses of GraphAlgorithm in org.graph4j.shortestpath

Subclasses of GraphAlgorithm in org.graph4j.shortestpath

Modifier and Type	Class	Description
class	AStarAlgorithm	A* algorithm finds the shortest path from a specified source vertex to a specified target vertex.
class	BellmanFordShortestPath	Bellman-Ford-Moore's algorithm finds the shortest paths between a source vertex and all the other vertices in a graph.
class	BFSAllPairsShortestPath	Determines the shortest paths between all pairs of vertices, in an unweighted graph, using breadth-first traversals.
class	BFSSinglePairShortestPath	Determines the path with the fewest edges connecting two vertices.
class	BFSSingleSourceShortestPath	Determines the shortest paths from a source vertex to all other vertices, in an unweighted graph, using a breadth-first traversal.
class	BidirectionalDijkstra	Determines the shortest path between two vertices.
class	DijkstraShortestPathBase	Dijkstra's algorithm finds the minimum cost paths between a vertex (called source) and all the other vertices in a graph, with the condition that there are no negative weighted edges.
class	DijkstraShortestPathDefault	Implementation of Dijkstra's algorithm that iterates through the unsolved vertices in order to select the optimal vertex at each step.
class	DijkstraShortestPathHeap	Implementation of Dijkstra's algorithm that uses a heap in order to select the optimal vertex at each step.
class	FloydWarshallShortestPath	Floyd-Warshall's algorithm finds the shortest paths between all pairs of vertices in an edge-weighted directed graph.
class	JohnsonShortestPath	Johnson's algorithm finds the shortest paths between all pairs of vertices in an edge-weighted directed graph.

Uses of GraphAlgorithm in org.graph4j.spanning

Subclasses of GraphAlgorithm in org.graph4j.spanning

Modifier and Type	Class	Description
class	BoruvkaMinimumSpanningTreeBase	Base class for Boruvka's minimum spanning tree implementations.
class	BoruvkaMinimumSpanningTreeDefault	Boruvka algorithm for finding a minimum spanning tree.
class	BoruvkaMinimumSpanningTreeParallel	Parallel implementation of the Boruvka algorithm for finding a minimum spanning tree.
class	KruskalMinimumSpanningTree	Kruskal's algorithm for finding a minimum spanning tree.
class	MinimumSpanningTreeBase	Base class for minimum spanning tree algorithms.
class	ParallelFilterKruskal	Parallel implementation of the Filter-Kruskal algorithm for finding a minimum spanning tree.
class	PrimMinimumSpanningTree	Implementation of Prim's algorithm that uses a binary heap.