Interface | Description |
---|---|
Adjacency<T> |
Representation of a graph (i.e.
|
Tarjan<NODE> |
Interface for the Tarjan's strongly connected components algorithm.
|
Class | Description |
---|---|
AbstractTarjan<NODE> |
Basic implementation for the Tarjan algorithm.
|
BloomFilter<E> |
Implementation of a Bloom-filter, as described here:
http://en.wikipedia.org/wiki/Bloom_filter
Inspired by the SimpleBloomFilter-class written by Ian Clarke.
|
ClassExpressionPair | |
MappingTarjan<T> |
Extension of the
AbstractTarjan implementation to use internal map
for handling the required information for a node. |
ShuntGraphUtils |
Alternative method for generating ShuntGraphs - experimental
|
ShuntGraphUtils.ShuntGraphPair |
Result object containing two corresponding shunt graphs.
|
Copyright © 2010–2015. All rights reserved.