Module org.jgrapht.core
Package org.jgrapht.alg.shortestpath
Class ContractionHierarchyPrecomputation.VertexData
java.lang.Object
org.jgrapht.alg.shortestpath.ContractionHierarchyPrecomputation.VertexData
- Enclosing class:
ContractionHierarchyPrecomputation<V,
E>
Contains information of a vertex needed during the contraction.
-
Field Summary
FieldsModifier and TypeFieldDescription(package private) int
Hierarchical depth of a vertex measured in the number of hops that can be performed while descending into the lower levels of the hierarchy.(package private) boolean
Determines if a vertex is already contracted or not.(package private) boolean
Determines if a vertex is independent or not.(package private) double
Priority of a vertex.(package private) int
Random number used for tie breaking during computing independent set. -
Constructor Summary
ConstructorsConstructorDescriptionVertexData
(int random) Constructs an instance of data for given random value. -
Method Summary
-
Field Details
-
depth
int depthHierarchical depth of a vertex measured in the number of hops that can be performed while descending into the lower levels of the hierarchy. -
random
int randomRandom number used for tie breaking during computing independent set. -
priority
double priorityPriority of a vertex. -
isContracted
boolean isContractedDetermines if a vertex is already contracted or not. -
isIndependent
boolean isIndependentDetermines if a vertex is independent or not.
-
-
Constructor Details
-
VertexData
VertexData(int random) Constructs an instance of data for given random value.- Parameters:
random
- random number
-