Uses of Class
bcds.phison.Path

Packages that use Path

bcds.phison	This package defines essential graph entities, such as nodes, links and paths.
bcds.phison.alg	This package contains implementations of basic graph algorithms, for example, for finding connected components, and minimum max-flows between node pairs.
bcds.phison.gm	Classes in this package extract measurable properties of a graph, its nodes or links.
bcds.phison.ra	The routing algorithm (ra) package defines the interface expected by the Phison simulator and implements several well-known routing algorithms, such as Dijkstra, WSP and SWP.
bcds.phison.sim	This package comprises the simulator and several processing modules.

Uses of Path in bcds.phison

Methods in bcds.phison that return Path

Path<V,E>	Path.reverse() Given a path a-b-c-d, returns d-c-b-a.
Path<V,E>	Path.subList(int start, int end) Returns a sublist of links of this path.

Methods in bcds.phison that return types with arguments of type Path

static <V,E> SimplePair<Path<V,E>,Path<V,E>>	GraphUtil.splitProtAndUnprotParts(Path<V,E> pri, Path<V,E> sec) Given two paths pri and sec, of which the first is the primary path and the second the backup path, returns pri split into two segments, the unprotected and protected parts.
static <V,E> SimplePair<Path<V,E>,Path<V,E>>	GraphUtil.splitProtAndUnprotParts(Path<V,E> pri, Path<V,E> sec) Given two paths pri and sec, of which the first is the primary path and the second the backup path, returns pri split into two segments, the unprotected and protected parts.

Methods in bcds.phison with parameters of type Path

java.util.Map<E,java.lang.Double>	NetAvail.eachLinkAvail(Path<V,E> p)
static <V,E> SimGraph<V,E>	GraphUtil.filterOutBidiLinks(SimGraph<V,E> g, Path<V,E> path) Returns a subgraph in which the edges of path do not appear.
static <V,E> SimGraph<V,E>	GraphUtil.filterOutIntermediateNodes(SimGraph<V,E> g, Path<V,E> path) Returns a subgraph in which the non-end of path are absent.
static <V,E> boolean	GraphUtil.pathContainsBidiLink(SimGraph<V,E> g, E e, Path<V,E> path) Returns true if path contains the link e, either as e itself or as reverse(e).
double	NetAvail.pathUnavailability(Path<V,E> p)
double	NetAvail.protectedPathAvail(Path<V,E> pri, Path<V,E> sec, java.util.Map<E,java.lang.Double> link_avail)
double	NetAvail.protectedPathAvail(Path<V,E> pri, Path<V,E> sec, java.util.Map<E,java.lang.Double> link_avail)
static <V,E> SimplePair<Path<V,E>,Path<V,E>>	GraphUtil.splitProtAndUnprotParts(Path<V,E> pri, Path<V,E> sec) Given two paths pri and sec, of which the first is the primary path and the second the backup path, returns pri split into two segments, the unprotected and protected parts.
static <V,E> SimplePair<Path<V,E>,Path<V,E>>	GraphUtil.splitProtAndUnprotParts(Path<V,E> pri, Path<V,E> sec) Given two paths pri and sec, of which the first is the primary path and the second the backup path, returns pri split into two segments, the unprotected and protected parts.

Uses of Path in bcds.phison.alg

Methods in bcds.phison.alg that return Path

Path<V,E>	MaxFlowEK.getPath(int n) Returns the n-th path (or subflow) that supports the previously computed max-flow, or null if n is out of range (there are not that many paths).
Path<V,E>	FloydWarshall.run(V src, V dest, int rq_cap) Returns the shortest path between nodes src and dest.

Uses of Path in bcds.phison.gm

Methods in bcds.phison.gm that return Path

Path<V,E>

Diameter.getLongestPath() Returns the path that corresponds to the diameter, computed by run.

Uses of Path in bcds.phison.ra

Fields in bcds.phison.ra declared as Path

Path<V,E>	ConnectionInfo.bkp_path Backup path assigned to this connection (it can be null).
Path<V,E>	ConnectionInfo.wrk_path Working path assigned to this connection.

Methods in bcds.phison.ra that return Path

Path<V,E>	RoutingAlgBase.buildPathFromParentNodes(SimGraph<V,E> g, V dest, java.util.Map<V,V> parent) Builds a Path object from the "parent" structure produced by routing algorithms such as Dijkstra's.
Path<V,E>	ProtectionAlgBase.getBackupPath() Returns the backup path found in the last call to run.
Path<V,E>	RoutingAlg.getBackupPath() Returns the back up computed during the latest invocation of run(), and null to indicate that no backup path could be found.
Path<V,E>	RoutingAlgBase.getBackupPath() Throws UnsupportedOperationException to indicate that protection is not implemented.
Path<V,E>	RoutingAlg.getWorkingPath() Returns the path produced by the latest invocation of run().
Path<V,E>	RoutingAlgBase.getWorkingPath() Returns a reference to the object returned by the last call to run().
Path<V,E>	DijkstraAll.obtain(V dest) Returns the shortest path to dest that has been computed in a previous call to runAll().
Path<V,E>	DijkstraAll.obtain(V src, V dest) Deprecated. Replaced by DijkstraAll.obtain(V) so that it is clear that the source node is (implicitly) the one that has been passed to runAll().
Path<V,E>	DijkstraAll.run(V src, V dest, int rq_cap) Returns the shortest path from src to dest with the restriction that residual capacity must be at least rq_cap along the path.
Path<V,E>	LMIR.run(V src, V dest, int rq_cap) Returns al LMIR path from src to dest whose links have residual capacity at least equal to rq_cap, or null if no path can be found.
Path<V,E>	Null.run(V src, V dest, int rq_cap) Always returns null.
Path<V,E>	ProtDPP_MinCost.run(V src, V dest, int rq_cap)
Path<V,E>	RoutingAlg.run(V src, V dest, int rq_cap) Returns a path between src and dest, or null if such path cannot be found.
Path<V,E>	SWP.run(V src, V dest, int rq_cap) Returns a SWP path whose links have residual capacity at least equal to rq_cap.
Path<V,E>	DijkstraAll.runAll(V src, V dest, int rq_cap) Returns the shortest path from src to dest just as DijkstraAll.run(V, V, int) but also makes sure that Dijkstra's algorithm runs to completion (that is, creates the full tree rooted at src), thus enabling the use of obtain() later on.

Methods in bcds.phison.ra with parameters of type Path

E	TED.getFirstFailedBidiLink(Path<V,E> path) Returns the first link of path that is currently registered as failed, or null if all links are operative.
void	TED.registerConnPerLink(ConnectionInfo<V,E> cnx, Path<V,E> path) Updates the list of connections using the links of a given path.
void	RoutingAlgBase.setBackupPath(Path<V,E> path) Sets the backup path.
void	RoutingAlgBase.setWorkingPath(Path<V,E> path) Sets the working path.
void	TED.unregisterConnPerLink(ConnectionInfo<V,E> cnx, Path<V,E> path) Removes connection cnx from the list of connections passing through the links in path.
void	TED.updateResidualCap(ConnectionInfo<V,E> cnx, Path<V,E> path, int delta) Updates the residual capacity of links on a given path.
void	TED.updateResidualCap(ConnectionInfo<V,E> cnx, Path<V,E> path, int delta, boolean bidir) Updates the residual capacity of links on a given path.

Constructors in bcds.phison.ra with parameters of type Path

ConnectionInfo(int id, int cap, Path<V,E> wrk_path, Path<V,E> bkp_path)
Instanciates a ConnectionInfo, with a given id, capacity and paths.

ConnectionInfo(int id, int cap, Path<V,E> wrk_path, Path<V,E> bkp_path)
Instanciates a ConnectionInfo, with a given id, capacity and paths.

Uses of Path in bcds.phison.sim

Methods in bcds.phison.sim with parameters of type Path

void	PmTracePathLength.PathBetweenPairs.countPath(V n1, V n2, Path<V,E> path) Increment the frequency of |path|, |P|=path length.