BaseBidirectionalShortestPathAlgorithm.BaseSearchFrontier

java.lang.Object
- org.jgrapht.alg.shortestpath.BaseBidirectionalShortestPathAlgorithm.BaseSearchFrontier<V,E>

Type Parameters:

V - vertices type

E - edges type

Direct Known Subclasses:

BidirectionalAStarShortestPath.AStarSearchFrontier, BidirectionalDijkstraShortestPath.DijkstraSearchFrontier

Enclosing class:

BaseBidirectionalShortestPathAlgorithm<V,E>
```
abstract static class BaseBidirectionalShortestPathAlgorithm.BaseSearchFrontier<V,E>
extends java.lang.Object
```
Base class of the search frontier used by bidirectional shortest path algorithms.

Field Summary

Fields
Modifier and Type Field Description

(package private) Graph<V,E> graph
Frontier`s graph.

Constructor Summary

Constructors
Constructor Description

BaseSearchFrontier(Graph<V,E> graph)
Constructs instance for a given graph.

Method Summary

All Methods Instance Methods Abstract Methods
Modifier and Type	Method	Description
`(package private) abstract double`	`getDistance(V v)`	Returns distance to vertex `v` computed so far.
`(package private) abstract E`	`getTreeEdge(V v)`	Returns edge which connects `v` to its predecessor in the shortest paths tree of this frontier.

Methods inherited from class java.lang.Object
clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

- Field Detail
  - graph
```
final Graph<V,E> graph
```
    Frontier`s graph.
- Constructor Detail
  - BaseSearchFrontier
```
BaseSearchFrontier(Graph<V,E> graph)
```
    Constructs instance for a given graph.
    
    Parameters:
    
    graph - graph
- Method Detail
  - getDistance
```
abstract double getDistance(V v)
```
    Returns distance to vertex v computed so far.
    
    Parameters:
    
    v - vertex
    
    Returns:
    
    distance to v
  - getTreeEdge
```
abstract E getTreeEdge(V v)
```
    Returns edge which connects v to its predecessor in the shortest paths tree of this frontier.
    
    Parameters:
    
    v - vertex
    
    Returns:
    
    edge in shortest paths tree