| Modifier and Type | Class and Description |
|---|---|
class |
EMFDataSource |
| Constructor and Description |
|---|
CountingAlg(IGraphDataSource<V> gds)
Constructs a new Counting algorithm and initializes the transitive closure relation with the given graph data
source.
|
| Constructor and Description |
|---|
DRedAlg(IGraphDataSource<V> gds)
Constructs a new DRED algorithm and initializes the transitive closure relation with the given graph data source.
|
DRedAlg(IGraphDataSource<V> gds,
DRedTcRelation<V> tc)
Constructs a new DRED algorithm and initializes the transitive closure relation with the given relation.
|
| Constructor and Description |
|---|
FloydWarshallAlg(IGraphDataSource<V> gds) |
| Constructor and Description |
|---|
IncSCCAlg(IGraphDataSource<V> graphDataSource) |
| Modifier and Type | Method and Description |
|---|---|
static <V> java.util.List<V> |
GraphHelper.constructPath(V source,
V target,
java.util.Set<V> nodesInGraph,
IGraphDataSource<V> graphDataSource)
Constructs a path between source and target in the given graph.
|
static <V> int |
GraphHelper.getEdgeCount(V node,
IGraphDataSource<V> graphDataSource)
Returns the number of self-loop edges for the given node.
|
static <V> int |
GraphHelper.getEdgeCount(V source,
V target,
IGraphDataSource<V> graphDataSource)
Returns the number of edges between the given source and target nodes.
|
| Constructor and Description |
|---|
DFSPathFinder(IGraphDataSource<V> graph,
ITcDataSource<V> itc) |
| Modifier and Type | Method and Description |
|---|---|
static <V> java.util.Set<V> |
BFS.collectNodesAlongPath(V source,
V target,
IGraphDataSource<V> graph)
Performs a breadth first search on the given graph and collects all the nodes along the path from source to
target if such path exists.
|
static <V> boolean |
BFS.isReachable(V source,
V target,
IGraphDataSource<V> graph)
Performs a breadth first search on the given graph to determine whether source is reachable from target.
|
static <V> java.util.Set<V> |
BFS.reachableTargets(IGraphDataSource<V> graph,
V source) |
| Constructor and Description |
|---|
DFSAlg(IGraphDataSource<V> gds) |
| Modifier and Type | Method and Description |
|---|---|
static <V> SCCResult<V> |
SCC.computeSCC(IGraphDataSource<V> g)
Computes the SCCs for the given graph and returns them as a multiset.
|
| Constructor and Description |
|---|
PKAlg(IGraphDataSource<V> gds) |
SCCResult(java.util.Set<java.util.Set<V>> sccs,
IGraphDataSource<V> gds) |
| Modifier and Type | Method and Description |
|---|---|
static java.util.List<?> |
TopSort.getTopologicalSorting(IGraphDataSource<?> g) |
| Constructor and Description |
|---|
TopSort(IGraphDataSource<V> g) |
| Modifier and Type | Class and Description |
|---|---|
class |
Graph<V> |
| Modifier and Type | Interface and Description |
|---|---|
interface |
IBiDirectionalGraphDataSource<V>
This interface extends the functionality of IGraphDataSource with an extra method.
|
| Modifier and Type | Class and Description |
|---|---|
class |
IBiDirectionalWrapper<V>
This class can be used to wrap an
IGraphDataSource into an IBiDirectionalGraphDataSource. |
| Constructor and Description |
|---|
IBiDirectionalWrapper(IGraphDataSource<V> gds) |