Package  Description 

org.onlab.graph 
Graph abstractions and graph path finding algorithms.

org.onosproject.net.topology 
Network topology model & related services API definitions.

Modifier and Type  Class and Description 

class 
AbstractEdge<V extends Vertex>
Abstract graph edge implementation.

class 
AbstractGraphPathSearch<V extends Vertex,E extends Edge<V>>
Basis for various graph path search algorithm implementations.

class 
AdjacencyListsGraph<V extends Vertex,E extends Edge<V>>
Immutable graph implemented using adjacency lists.

class 
BellmanFordGraphSearch<V extends Vertex,E extends Edge<V>>
BellmanFord graph search algorithm for locating shortestpaths in
directed graphs that may contain negative cycles.

class 
BreadthFirstSearch<V extends Vertex,E extends Edge<V>>
Implementation of the BFS algorithm.

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 
DepthFirstSearch<V extends Vertex,E extends Edge<V>>
DFS graph search algorithm implemented via iteration rather than recursion.

class 
DijkstraGraphSearch<V extends Vertex,E extends Edge<V>>
Dijkstra shortestpath graph search algorithm capable of finding not just
one, but all shortest paths between the source and destinations.

class 
DisjointPathPair<V extends Vertex,E extends Edge<V>>
Pair of disjoint paths.

interface 
Edge<V extends Vertex>
Representation of a graph edge.

interface 
EdgeWeight<V extends Vertex,E extends Edge<V>>
Abstraction of a graph edge weight function.

interface 
Graph<V extends Vertex,E extends Edge>
Abstraction of a directed graph structure.

interface 
GraphPathSearch<V extends Vertex,E extends Edge<V>>
Representation of a graph path search algorithm.

static interface 
GraphPathSearch.Result<V extends Vertex,E extends Edge<V>>
Abstraction of a path search result.

interface 
GraphSearch<V extends Vertex,E extends Edge<V>>
Representation of a graph search algorithm and its outcome.

static interface 
GraphSearch.Result<V extends Vertex,E extends Edge<V>>
Notion of a graph search result.

class 
KShortestPathsSearch<V extends Vertex,E extends Edge<V>>
Runs K shortest paths algorithm on a provided directed graph.

class 
MutableAdjacencyListsGraph<V extends Vertex,E extends Edge<V>> 
interface 
MutableGraph<V extends Vertex,E extends Edge>
Abstraction of a mutable graph that can be constructed gradually.

interface 
MutablePath<V extends Vertex,E extends Edge<V>>
Abstraction of a mutable path that allows gradual construction.

interface 
Path<V extends Vertex,E extends Edge<V>>
Representation of a path in a graph as a sequence of edges.

class 
SrlgGraphSearch<V extends Vertex,E extends Edge<V>>
SRLG Graph Search finds a pair of paths with disjoint risk groups; i.e
if one path goes through an edge in risk group 1, the other path will go
through no edges in risk group 1.

class 
SuurballeGraphSearch<V extends Vertex,E extends Edge<V>>
Suurballe shortestpath graph search algorithm capable of finding both
a shortest path, as well as a backup shortest path, between a source and a destination
such that the sum of the path lengths is minimized.

class 
TarjanGraphSearch<V extends Vertex,E extends Edge<V>>
Tarjan algorithm for searching a graph and producing results describing
the graph SCC (stronglyconnected components).

static class 
TarjanGraphSearch.SccResult<V extends Vertex,E extends Edge<V>>
Graph search result augmented with SCC vertexData.

Modifier and Type  Field and Description 

(package private) V 
SrlgGraphSearch.dst 
(package private) V 
SrlgGraphSearch.src 
Modifier and Type  Interface and Description 

interface 
TopologyVertex
Represents a vertex in the topology graph.

Modifier and Type  Class and Description 

class 
DefaultTopologyVertex
Implementation of the topology vertex backed by a device id.

Copyright © 2016. All rights reserved.