Package org.onlab.graph
Class DisjointPathPair<V extends Vertex,E extends Edge<V>>
- java.lang.Object
-
- org.onlab.graph.DisjointPathPair<V,E>
-
-
Method Summary
All Methods Instance Methods Concrete Methods Modifier and Type Method Description Weightcost()Returns the total cost of the path as a weight object.Vdst()Returns the edge destination vertex.List<E>edges()Returns the list of edges comprising the path.booleanequals(Object obj)booleanhasBackup()Checks if this path pair contains a backup/secondary path.inthashCode()Path<V,E>primary()Returns the primary path.Path<V,E>secondary()Returns the secondary path.intsize()Returns number of paths inside this path pair object.Vsrc()Returns the edge source vertex.StringtoString()
-
-
-
Method Detail
-
secondary
public Path<V,E> secondary()
Returns the secondary path.- Returns:
- secondary path, or null if there is no secondary path available.
-
cost
public Weight cost()
Description copied from interface:PathReturns the total cost of the path as a weight object.
-
edges
public List<E> edges()
Description copied from interface:PathReturns the list of edges comprising the path. Adjacent edges will share the same vertex, meaning that a source of one edge, will be the same as the destination of the prior edge.
-
hasBackup
public boolean hasBackup()
Checks if this path pair contains a backup/secondary path.- Returns:
- boolean representing whether it has backup
-
size
public int size()
Returns number of paths inside this path pair object.- Returns:
- number of paths
-
-