Module org.jgrapht.core

Package org.jgrapht.alg.shortestpath

Class EppsteinShortestPathIterator.PathsGraphVertex

java.lang.Object

org.jgrapht.alg.shortestpath.EppsteinShortestPathIterator.PathsGraphVertex

All Implemented Interfaces:

Comparable<EppsteinShortestPathIterator<V,E>.PathsGraphVertex>

Enclosing class:

EppsteinShortestPathIterator<V,E>

private class EppsteinShortestPathIterator.PathsGraphVertex
extends Object
implements Comparable<EppsteinShortestPathIterator<V,E>.PathsGraphVertex>

Vertex of the paths graph. Does not maintain the weights of the edges to left, right, rest and cross vertices, because they are computed during the paths graph traversal.

Field Summary

Fields

Modifier and Type	Field	Description
(package private) EppsteinShortestPathIterator<V,E>.PathsGraphVertex	cross
(package private) double	delta	$Delta(edge)$ value.
(package private) E	edge	Edge this vertex corresponds to.
(package private) EppsteinShortestPathIterator<V,E>.PathsGraphVertex	left
(package private) EppsteinShortestPathIterator<V,E>.PathsGraphVertex	rest
(package private) EppsteinShortestPathIterator<V,E>.PathsGraphVertex	right
(package private) int	size	If this vertex is part of a balanced heap of outroots in the path graph, this value is used to determine where a new vertex should be inserted in order for the heap to remain balanced.

Constructor Summary

Constructors

Constructor	Description
PathsGraphVertex(E edge, double delta)
PathsGraphVertex(EppsteinShortestPathIterator<V,E>.PathsGraphVertex other)	Copy constructor.

Method Summary

Modifier and Type	Method	Description
int	compareTo(EppsteinShortestPathIterator<V,E>.PathsGraphVertex o)

Methods inherited from class java.lang.Object

clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

Field Details

edge

E edge

Edge this vertex corresponds to.

delta

double delta

$Delta(edge)$ value.

size

int size

If this vertex is part of a balanced heap of outroots in the path graph, this value is used to determine where a new vertex should be inserted in order for the heap to remain balanced.

left

EppsteinShortestPathIterator<V,E>.PathsGraphVertex left

right

EppsteinShortestPathIterator<V,E>.PathsGraphVertex right

rest

EppsteinShortestPathIterator<V,E>.PathsGraphVertex rest

cross

EppsteinShortestPathIterator<V,E>.PathsGraphVertex cross

Constructor Details

PathsGraphVertex

PathsGraphVertex(E edge,
 double delta)

PathsGraphVertex

PathsGraphVertex(EppsteinShortestPathIterator<V,E>.PathsGraphVertex other)

Copy constructor.

Parameters:

other - other vertex

Method Details

compareTo

public int compareTo(EppsteinShortestPathIterator<V,E>.PathsGraphVertex o)

Specified by:

compareTo in interface Comparable<EppsteinShortestPathIterator<V,E>.PathsGraphVertex>