Module org.jgrapht.core
Package org.jgrapht.alg.shortestpath
Class IntVertexDijkstraShortestPath.IdentifierMap
java.lang.Object
org.jgrapht.alg.shortestpath.IntVertexDijkstraShortestPath.IdentifierMap
- Enclosing class:
IntVertexDijkstraShortestPath<E>
A very special case linear probing hash table, fit for this particular use case. The code
assumes several invariants such as that the user will never add more elements than its
capacity, etc.
-
Field Summary
Fields -
Constructor Summary
Constructors -
Method Summary
-
Field Details
-
keys
private int[] keys -
values
private int[] values -
m
private int m
-
-
Constructor Details
-
IdentifierMap
public IdentifierMap(int m)
-
-
Method Details
-
put
public void put(int key, int value) -
get
public int get(int key) -
hash
private int hash(int key)
-