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

Packages that use HierholzerEulerianCycle.EdgeNode

Package	Description
org.jgrapht.alg.cycle	Algorithms related to graph cycles.

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

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

Modifier and Type	Field and Description
HierholzerEulerianCycle.EdgeNode	HierholzerEulerianCycle.VertexNode.adjEdgesHead
protected HierholzerEulerianCycle.EdgeNode	HierholzerEulerianCycle.eulerianHead
HierholzerEulerianCycle.EdgeNode	HierholzerEulerianCycle.VertexNode.insertLocation
HierholzerEulerianCycle.EdgeNode	HierholzerEulerianCycle.EdgeNode.next
HierholzerEulerianCycle.EdgeNode	HierholzerEulerianCycle.EdgeNode.prev
HierholzerEulerianCycle.EdgeNode	HierholzerEulerianCycle.EdgeNode.reverse

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

Modifier and Type	Method and Description
protected Pair<HierholzerEulerianCycle.EdgeNode,HierholzerEulerianCycle.EdgeNode>	HierholzerEulerianCycle.computePartialCycle() Computes a partial cycle assuming that all vertices have an even degree.
protected 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 and Description
protected HierholzerEulerianCycle.VertexNode	HierholzerEulerianCycle.getOppositeVertex(HierholzerEulerianCycle.VertexNode v, HierholzerEulerianCycle.EdgeNode e) Compute the opposite end-point of an end-point of an edge.
protected void	HierholzerEulerianCycle.unlink(HierholzerEulerianCycle.EdgeNode eNode) Unlink an edge from the adjacency lists of its end-points.

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

Modifier and Type	Method and Description
protected 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.
protected 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 and Description
EdgeNode(HierholzerEulerianCycle.VertexNode sourceNode, HierholzerEulerianCycle.VertexNode targetNode, HierholzerEulerianCycle.EdgeNode prev, E e, HierholzerEulerianCycle.EdgeNode reverse, HierholzerEulerianCycle.EdgeNode next) Create EdgeNode
EdgeNode(HierholzerEulerianCycle.VertexNode sourceNode, HierholzerEulerianCycle.VertexNode targetNode, HierholzerEulerianCycle.EdgeNode prev, E e, HierholzerEulerianCycle.EdgeNode reverse, HierholzerEulerianCycle.EdgeNode next) Create EdgeNode
EdgeNode(HierholzerEulerianCycle.VertexNode sourceNode, HierholzerEulerianCycle.VertexNode targetNode, HierholzerEulerianCycle.EdgeNode prev, E e, HierholzerEulerianCycle.EdgeNode reverse, HierholzerEulerianCycle.EdgeNode next) Create EdgeNode