Uses of Class
bcds.phison.ra.DijkstraAll.PathExpansionInfo

Packages that use DijkstraAll.PathExpansionInfo

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.

Uses of DijkstraAll.PathExpansionInfo in bcds.phison.ra

Methods in bcds.phison.ra that return DijkstraAll.PathExpansionInfo

DijkstraAll.PathExpansionInfo	DijkstraAll.evalEdge(E e) Evaluates the path whose last hop is the link e and determines whether target(e) can have a shorter path via source(e) than what it has now.
DijkstraAll.PathExpansionInfo	DijkstraMaxWidth.evalEdge(E e) Returns an object with the field is_shorter set to true if link e offers a "wider" path to target(e), or it is of the same "width" but the source is shorter throuth it in number of hops.
DijkstraAll.PathExpansionInfo	WSP.evalEdge(E e) Evaluates the path whose last hop is e and determines if it leads to target(e) through a shorter path.

Methods in bcds.phison.ra with parameters of type DijkstraAll.PathExpansionInfo

void	DijkstraAll.dumpEvalEdgeState(E e, DijkstraAll.PathExpansionInfo pe) Prints debugging information concerning pe and e.