| Package | Description |
|---|---|
| org.onlab.graph |
Graph abstractions and graph path finding algorithms.
|
| Modifier and Type | Interface and Description |
|---|---|
interface |
MutablePath<V extends Vertex,E extends Edge<V>>
Abstraction of a mutable path that allows gradual construction.
|
| Modifier and Type | Class and Description |
|---|---|
class |
DefaultMutablePath<V extends Vertex,E extends Edge<V>>
Simple concrete implementation of a directed graph path.
|
class |
DefaultPath<V extends Vertex,E extends Edge<V>>
Simple concrete implementation of a directed graph path.
|
class |
DisjointPathPair<V extends Vertex,E extends Edge<V>>
Pair of disjoint paths.
|
| Modifier and Type | Field and Description |
|---|---|
protected Set<Path<V,E>> |
AbstractGraphPathSearch.DefaultResult.paths |
| Modifier and Type | Method and Description |
|---|---|
Path<V,E> |
DisjointPathPair.primary()
Returns the primary path.
|
Path<V,E> |
DisjointPathPair.secondary()
Returns the secondary path.
|
Path<V,E> |
MutablePath.toImmutable()
Returns an immutable copy of this path.
|
Path<V,E> |
DefaultMutablePath.toImmutable() |
| Modifier and Type | Method and Description |
|---|---|
Set<Path<V,E>> |
KShortestPathsSearch.InnerOrderedResult.paths() |
Set<Path<V,E>> |
GraphPathSearch.Result.paths()
Returns the set of paths produced as a result of the graph search.
|
Set<Path<V,E>> |
AbstractGraphPathSearch.DefaultResult.paths() |
| Constructor and Description |
|---|
DefaultMutablePath(Path<V,E> path)
Creates a new path as a copy of another path.
|
DisjointPathPair(Path<V,E> primary,
Path<V,E> secondary)
Creates a disjoint path pair from two paths.
|
DisjointPathPair(Path<V,E> primary,
Path<V,E> secondary)
Creates a disjoint path pair from two paths.
|
Copyright © 2016. All rights reserved.