Uses of Class
org.jgrapht.alg.cycle.HierholzerEulerianCycle.EdgeNode

Packages that use HierholzerEulerianCycle.EdgeNode

Package	Description
org.jgrapht.alg.cycle	Algorithms for enumeration of simple cycles in graphs.

Uses of HierholzerEulerianCycle.EdgeNode in org.jgrapht.alg.cycle

Fields in org.jgrapht.alg.cycle declared as HierholzerEulerianCycle.EdgeNode

Modifier and Type	Field	Description
(package private) HierholzerEulerianCycle.EdgeNode	HierholzerEulerianCycle.VertexNode.adjEdgesHead
private HierholzerEulerianCycle.EdgeNode	HierholzerEulerianCycle.eulerianHead
(package private) HierholzerEulerianCycle.EdgeNode	HierholzerEulerianCycle.VertexNode.insertLocation
(package private) HierholzerEulerianCycle.EdgeNode	HierholzerEulerianCycle.EdgeNode.next
(package private) HierholzerEulerianCycle.EdgeNode	HierholzerEulerianCycle.EdgeNode.prev
(package private) HierholzerEulerianCycle.EdgeNode	HierholzerEulerianCycle.EdgeNode.reverse

Methods in org.jgrapht.alg.cycle that return types with arguments of type HierholzerEulerianCycle.EdgeNode

Modifier and Type	Method	Description
private Pair<HierholzerEulerianCycle.EdgeNode,HierholzerEulerianCycle.EdgeNode>	HierholzerEulerianCycle.computePartialCycle()	Computes a partial cycle assuming that all vertices have an even degree.
private Pair<HierholzerEulerianCycle.EdgeNode,HierholzerEulerianCycle.EdgeNode>	HierholzerEulerianCycle.computePartialCycle()	Computes a partial cycle assuming that all vertices have an even degree.

Methods in org.jgrapht.alg.cycle with parameters of type HierholzerEulerianCycle.EdgeNode

Modifier and Type	Method	Description
private HierholzerEulerianCycle.VertexNode	HierholzerEulerianCycle.getOppositeVertex(HierholzerEulerianCycle.VertexNode v, HierholzerEulerianCycle.EdgeNode e)
private void	HierholzerEulerianCycle.unlink(HierholzerEulerianCycle.EdgeNode eNode)

Method parameters in org.jgrapht.alg.cycle with type arguments of type HierholzerEulerianCycle.EdgeNode

Modifier and Type	Method	Description
private void	HierholzerEulerianCycle.updateGraphAndInsertLocations(Pair<HierholzerEulerianCycle.EdgeNode,HierholzerEulerianCycle.EdgeNode> partialCycle, HierholzerEulerianCycle.VertexNode partialCycleSourceVertex)	Iterate over the partial cycle to remove vertices with zero degrees and compute new insert locations for vertices with non-zero degrees.
private void	HierholzerEulerianCycle.updateGraphAndInsertLocations(Pair<HierholzerEulerianCycle.EdgeNode,HierholzerEulerianCycle.EdgeNode> partialCycle, HierholzerEulerianCycle.VertexNode partialCycleSourceVertex)	Iterate over the partial cycle to remove vertices with zero degrees and compute new insert locations for vertices with non-zero degrees.

Constructors in org.jgrapht.alg.cycle with parameters of type HierholzerEulerianCycle.EdgeNode

Constructor	Description
EdgeNode(HierholzerEulerianCycle.VertexNode sourceNode, HierholzerEulerianCycle.VertexNode targetNode, HierholzerEulerianCycle.EdgeNode prev, E e, HierholzerEulerianCycle.EdgeNode reverse, HierholzerEulerianCycle.EdgeNode next)