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

Packages that use HierholzerEulerianCycle.VertexNode

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

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

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

Modifier and Type	Field	Description
HierholzerEulerianCycle<V,E>.VertexNode	HierholzerEulerianCycle.VertexNode.next
HierholzerEulerianCycle<V,E>.VertexNode	HierholzerEulerianCycle.VertexNode.prev
HierholzerEulerianCycle<V,E>.VertexNode	HierholzerEulerianCycle.EdgeNode.sourceNode
HierholzerEulerianCycle<V,E>.VertexNode	HierholzerEulerianCycle.EdgeNode.targetNode
protected HierholzerEulerianCycle<V,E>.VertexNode	HierholzerEulerianCycle.verticesHead

Methods in org.jgrapht.alg.cycle that return HierholzerEulerianCycle.VertexNode

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.

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

Modifier and Type	Method	Description
protected void	HierholzerEulerianCycle.addEdge(HierholzerEulerianCycle<V,E>.VertexNode sNode, HierholzerEulerianCycle<V,E>.VertexNode tNode, E e)	Add an edge to the index.
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.moveToFront(HierholzerEulerianCycle<V,E>.VertexNode vNode)	Move a vertex as first in the vertex list.
protected void	HierholzerEulerianCycle.unlink(HierholzerEulerianCycle<V,E>.VertexNode vNode)	Unlink a vertex from the vertex list.
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.VertexNode

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
	VertexNode(HierholzerEulerianCycle<V,E>.VertexNode prev, V v, HierholzerEulerianCycle<V,E>.VertexNode next)	Create VertexNode