EppsteinShortestPathIterator.PathsGraphVertex

java.lang.Object
- org.jgrapht.alg.shortestpath.EppsteinShortestPathIterator.PathsGraphVertex

All Implemented Interfaces:

java.lang.Comparable<EppsteinShortestPathIterator.PathsGraphVertex>

Enclosing class:

EppsteinShortestPathIterator<V,E>
```
private class EppsteinShortestPathIterator.PathsGraphVertex
extends java.lang.Object
implements java.lang.Comparable<EppsteinShortestPathIterator.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.PathsGraphVertex`	`cross`
`(package private) double`	`delta`	$Delta(edge)$ value.
`(package private) E`	`edge`	Edge this vertex corresponds to.
`(package private) EppsteinShortestPathIterator.PathsGraphVertex`	`left`
`(package private) EppsteinShortestPathIterator.PathsGraphVertex`	`rest`
`(package private) EppsteinShortestPathIterator.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.PathsGraphVertex other)`	Copy constructor.

Method Summary

All Methods Instance Methods Concrete Methods
Modifier and Type Method Description

int compareTo(EppsteinShortestPathIterator.PathsGraphVertex o)
- Methods inherited from class java.lang.Object
  clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

- Field Detail
  - 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.PathsGraphVertex left
```
  - right
```
EppsteinShortestPathIterator.PathsGraphVertex right
```
  - rest
```
EppsteinShortestPathIterator.PathsGraphVertex rest
```
  - cross
```
EppsteinShortestPathIterator.PathsGraphVertex cross
```
- Constructor Detail
  - PathsGraphVertex
```
PathsGraphVertex(E edge,
                 double delta)
```
  - PathsGraphVertex
```
PathsGraphVertex(EppsteinShortestPathIterator.PathsGraphVertex other)
```
    Copy constructor.
    
    Parameters:
    
    other - other vertex
- Method Detail
  - compareTo
```
public int compareTo(EppsteinShortestPathIterator.PathsGraphVertex o)
```
    Specified by:
    
    compareTo in interface java.lang.Comparable<EppsteinShortestPathIterator.PathsGraphVertex>