Package org.opendaylight.sfc.provider.topology

Class Summary

Class	Description
SfcProviderGraph	This class represents a topology graph, node/vertex is a SF (Service Function) or SFF (Service Function Forwarder), edge is a unidirect and direct connection between two nodes/vertexes, it is mainly used to implement Dijkstra shortest path algorithm, method getShortestPath can find the shortest path between 'from' node and 'to' node in a graph.
SfcProviderTopologyNode	This class represents a node/vertex in the topology graph that composes of SFs (Service Functions) and SFFs (Service Function Forwarders) , a node may be SF or SFF, please refer to class SfcProviderGraph for topology graph.