Module org.jgrapht.core
Package org.jgrapht.alg.spanning
Class GreedyMultiplicativeSpanner.UnweightedSpannerAlgorithm
java.lang.Object
GreedyMultiplicativeSpanner<V,E>.org.jgrapht.alg.spanning.GreedyMultiplicativeSpanner.SpannerAlgorithmBase
org.jgrapht.alg.spanning.GreedyMultiplicativeSpanner.UnweightedSpannerAlgorithm
- Enclosing class:
GreedyMultiplicativeSpanner<V,
E>
private class GreedyMultiplicativeSpanner.UnweightedSpannerAlgorithm
extends GreedyMultiplicativeSpanner<V,E>.SpannerAlgorithmBase
-
Field Summary
Fields -
Constructor Summary
Constructors -
Method Summary
Modifier and TypeMethodDescriptionvoid
addSpannerEdge
(V s, V t, double weight) boolean
isSpannerReachable
(V s, V t, double hops) Check if two vertices are reachable by a BFS in the spanner graph using only a certain number of hops.Methods inherited from class org.jgrapht.alg.spanning.GreedyMultiplicativeSpanner.SpannerAlgorithmBase
run
-
Field Details
-
spanner
-
vertexDistance
-
queue
-
touchedVertices
-
-
Constructor Details
-
UnweightedSpannerAlgorithm
public UnweightedSpannerAlgorithm()
-
-
Method Details
-
isSpannerReachable
Check if two vertices are reachable by a BFS in the spanner graph using only a certain number of hops. We execute this procedure repeatedly, therefore we need to keep track of what it touches and only clean those before the next execution.- Specified by:
isSpannerReachable
in classGreedyMultiplicativeSpanner<V,
E>.SpannerAlgorithmBase
-
addSpannerEdge
- Specified by:
addSpannerEdge
in classGreedyMultiplicativeSpanner<V,
E>.SpannerAlgorithmBase
-