@graphty/algorithms / index / CompactDistanceArray
Class: CompactDistanceArray ​
Defined in: optimized/bit-packed.ts:329
Bit-packed distance array for BFS
Optimized for storing distances using 16-bit integers (up to 65,535 levels) Still provides 2x memory savings compared to standard 32-bit numbers
Constructors ​
Constructor ​
new CompactDistanceArray(
size):CompactDistanceArray
Defined in: optimized/bit-packed.ts:338
Creates a new CompactDistanceArray with the specified size.
Parameters ​
size ​
number
The number of distance values to store
Returns ​
CompactDistanceArray
Methods ​
clear() ​
clear():
void
Defined in: optimized/bit-packed.ts:379
Reset all distances to unvisited state.
Returns ​
void
get() ​
get(
index):number
Defined in: optimized/bit-packed.ts:362
Get distance at the specified index.
Parameters ​
index ​
number
The node index to get the distance for
Returns ​
number
The distance value, or INFINITY if not set
isVisited() ​
isVisited(
index):boolean
Defined in: optimized/bit-packed.ts:372
Check if a node has been visited (has a valid distance).
Parameters ​
index ​
number
The node index to check
Returns ​
boolean
True if the node has been visited, false otherwise
set() ​
set(
index,distance):void
Defined in: optimized/bit-packed.ts:349
Set distance at the specified index.
Parameters ​
index ​
number
The node index to set the distance for
distance ​
number
The distance value to set
Returns ​
void
size() ​
size():
number
Defined in: optimized/bit-packed.ts:387
Get the size of the distance array.
Returns ​
number
The number of elements in the array