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	Description
HierholzerEulerianCycle<V,E>.EdgeNode	HierholzerEulerianCycle.VertexNode.adjEdgesHead
protected HierholzerEulerianCycle<V,E>.EdgeNode	HierholzerEulerianCycle.eulerianHead
HierholzerEulerianCycle<V,E>.EdgeNode	HierholzerEulerianCycle.VertexNode.insertLocation
HierholzerEulerianCycle<V,E>.EdgeNode	HierholzerEulerianCycle.EdgeNode.next
HierholzerEulerianCycle<V,E>.EdgeNode	HierholzerEulerianCycle.EdgeNode.prev
HierholzerEulerianCycle<V,E>.EdgeNode	HierholzerEulerianCycle.EdgeNode.reverse

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

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

Modifier	Constructor	Description
	EdgeNode(HierholzerEulerianCycle<V,E>.VertexNode sourceNode, HierholzerEulerianCycle<V,E>.VertexNode targetNode, HierholzerEulerianCycle<V,E>.EdgeNode prev, E e, HierholzerEulerianCycle<V,E>.EdgeNode reverse, HierholzerEulerianCycle<V,E>.EdgeNode next)	Create EdgeNode