ContractionHierarchyPrecomputation.VertexData

java.lang.Object
- org.jgrapht.alg.shortestpath.ContractionHierarchyPrecomputation.VertexData

Enclosing class:

ContractionHierarchyPrecomputation<V,E>
```
private static class ContractionHierarchyPrecomputation.VertexData
extends java.lang.Object
```
Contains information of a vertex needed during the contraction.

Field Summary

Fields
Modifier and Type	Field	Description
`(package private) int`	`depth`	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`	`isContracted`	Determines if a vertex is already contracted or not.
`(package private) boolean`	`isIndependent`	Determines if a vertex is independent or not.
`(package private) double`	`priority`	Priority of a vertex.
`(package private) int`	`random`	Random number used for tie breaking during computing independent set.

Constructor Summary

Constructors
Constructor Description

VertexData(int random)
Constructs an instance of data for given random value.

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

- Field Detail
  - depth
```
int depth
```
    Hierarchical 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 random
```
    Random number used for tie breaking during computing independent set.
  - priority
```
double priority
```
    Priority of a vertex.
  - isContracted
```
boolean isContracted
```
    Determines if a vertex is already contracted or not.
  - isIndependent
```
boolean isIndependent
```
    Determines if a vertex is independent or not.
- Constructor Detail
  - VertexData
```
VertexData(int random)
```
    Constructs an instance of data for given random value.
    
    Parameters:
    
    random - random number