| Package | Description |
|---|---|
| org.jgrapht.alg.shortestpath |
Shortest-path related algorithms.
|
| org.jgrapht.graph |
Implementations of various graphs.
|
| org.jgrapht.graph.specifics |
Implementations of specifics for various graph types.
|
| org.jgrapht.util |
Non-graph-specific data structures, algorithms, and utilities used by JGraphT.
|
| Class and Description |
|---|
| FibonacciHeap
This class implements a Fibonacci heap data structure.
|
| FibonacciHeapNode
Implements a node of the Fibonacci heap.
|
| Class and Description |
|---|
| WeightCombiner
Binary operator for edge weights.
|
| Class and Description |
|---|
| ArrayUnenforcedSet
Helper for efficiently representing small sets whose elements are known to be unique by
construction, implying we don't need to enforce the uniqueness property in the data structure
itself.
|
| Class and Description |
|---|
| FibonacciHeap
This class implements a Fibonacci heap data structure.
|
| FibonacciHeapNode
Implements a node of the Fibonacci heap.
|
| ModifiableInteger
The
ModifiableInteger class wraps a value of the primitive type int in
an object, similarly to Integer. |
| PrefetchIterator.NextElementFunctor
A functor for the calculation of the next element.
|
| TypeUtil
TypeUtil isolates type-unsafety so that code which uses it for legitimate reasons can stay
warning-free.
|
| WeightCombiner
Binary operator for edge weights.
|
Copyright © 2017. All rights reserved.