Uses of Class
org.graph4j.util.Cycle

Packages that use Cycle

Package	Description
org.graph4j.generators	Graph generators of various kinds.
org.graph4j.hamiltonian
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.support	Support algorithms for various type of graphs (bipartite, tournament, etc.).

Uses of Cycle in org.graph4j.generators

Methods in org.graph4j.generators that return Cycle

Modifier and Type	Method	Description
Cycle	RandomHamiltonianGenerator.getHamiltonianCycle()	The method returns the Hamiltonian cycle that was created as part of the generation process.

Uses of Cycle in org.graph4j.hamiltonian

Methods in org.graph4j.hamiltonian that return Cycle

Modifier and Type	Method	Description
Cycle	HamiltonianCycleAlgorithm.findCycle()
Cycle	PalmerHamiltonianCycle.findCycle()

Uses of Cycle in org.graph4j.route

Methods in org.graph4j.route that return Cycle

Modifier and Type	Method	Description
Cycle	CycleFinder.findAnyCycle()	Uses DFS in order to find a cycle.
Cycle	CycleFinder.findAnyCycle(int target)
Cycle	CycleFinder.findEvenCycle()
Cycle	CycleFinder.findLongCycle()	An heuristic for finding a long cycle.
Cycle	CycleFinder.findOddCycle()
Cycle	CycleFinder.findShortestCycle()	Uses BFS in order to find a cycle.
Cycle	CycleFinder.findShortestCycle(int target)

Uses of Cycle in org.graph4j.shortestpath

Methods in org.graph4j.shortestpath that return Cycle

Modifier and Type	Method	Description
Cycle	NegativeCycleException.getCycle()

Constructors in org.graph4j.shortestpath with parameters of type Cycle

Modifier	Constructor	Description
	NegativeCycleException(Cycle cycle)

Uses of Cycle in org.graph4j.support

Methods in org.graph4j.support that return Cycle

Modifier and Type	Method	Description
Cycle	ChordalGraphSupport.findHole()	Finds a hole, that is an induced cycle on four or more vertices, if the graph is not chordal.
Cycle	BipartiteGraphSupport.findOddCycle()	Determines an odd cycle, if the graph is not bipartite.