Packages

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.clustering
bcds.phison.cmd
bcds.phison.demo
bcds.phison.gentraf
bcds.phison.gm	Classes in this package extract measurable properties of a graph, its nodes or links.
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
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.
bcds.tools
bcds.tools.random
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.