A B C D E F G H I J K L M N O P Q R S T U V W Z

B

backupIsActive() - Method in class bcds.phison.ra.ConnectionInfo

Returns true when backup path is active.

BadFormatException - Exception in bcds.phison.io

A generic exception used when an input does not adhere to the expected format or there is a semantic error (for example, an alphabetic value is found where a number is expected).

BadFormatException(String) - Constructor for exception bcds.phison.io.BadFormatException

Creates a new exception object with the given message.

BadFormatException(String, Object...) - Constructor for exception bcds.phison.io.BadFormatException

bcds.phison - package bcds.phison

This package defines essential graph entities, such as nodes, links and paths.

bcds.phison.alg - package 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.clustering - package bcds.phison.clustering

bcds.phison.cmd - package bcds.phison.cmd

bcds.phison.demo - package bcds.phison.demo

bcds.phison.gentraf - package bcds.phison.gentraf

bcds.phison.gm - package bcds.phison.gm

Classes in this package extract measurable properties of a graph, its nodes or links.

bcds.phison.io - package bcds.phison.io

Classes in this package deal with reading or writing files (topologies in different formats, demand type defintions, zone maps, etc.).

bcds.phison.multfailures - package bcds.phison.multfailures

bcds.phison.ra - package 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 - package bcds.phison.sim

This package comprises the simulator and several processing modules.

bcds.tools - package bcds.tools

bcds.tools.random - package bcds.tools.random

bcds.tools.stat - package bcds.tools.stat

Classes in this package are used for defining variables of which certain statistical properties are of interest, for example the arithmetic mean and the standard deviation of a sample.

BetweennessCent - Class in bcds.phison.cmd

Compute the node and edge betweenness centrality of a given topology.

BetweennessCent() - Constructor for class bcds.phison.cmd.BetweennessCent

BetweennessCentrality<V,E> - Class in bcds.phison.gm

WARNING: This class will disappear as such (the Brandes' part will be folded into BrandesBC, and the rest...probably taken to the attic.

BetweennessCentrality(TED<V, E>) - Constructor for class bcds.phison.gm.BetweennessCentrality

BetweennessCentrality.Flags - Enum in bcds.phison.gm

bidiLinkIsFailed(E) - Method in class bcds.phison.ra.TED

Returns true if link e (either itself or its reverse) is registered as failed.

bkp_in_use - Variable in class bcds.phison.ra.ConnectionInfo

Set to true to indicate that this connection is using the backup path (for example, when the working path has failed).

bkp_path - Variable in class bcds.phison.ra.ConnectionInfo

Backup path assigned to this connection (it can be null).

booleanRandomTrafficMatrix(SimGraph<V, E>, Random) - Static method in class bcds.phison.GraphUtil

Generates a random traffic matrix consisting of 0s and 1s.

BrandesBC<V,E> - Class in bcds.phison.gm

Computes the betweenness centrality of nodes and links in a directed graph.

BrandesBC() - Constructor for class bcds.phison.gm.BrandesBC

Default constructor.

BrandesBC(SimGraph<V, E>, Environ) - Constructor for class bcds.phison.gm.BrandesBC

Creates a new instance and calls setup to complete the initialization.

brandesEdgeBC() - Method in class bcds.phison.gm.BetweennessCentrality

brandesNodeBC() - Method in class bcds.phison.gm.BetweennessCentrality

buildPathFromParentNodes(SimGraph<V, E>, V, Map<V, V>) - Method in class bcds.phison.ra.RoutingAlgBase

Builds a Path object from the "parent" structure produced by routing algorithms such as Dijkstra's.