See: Description
| Class | Description |
|---|---|
| CandidatePathList |
A candidate path list is an object containing a set of paths computed for
each demand in the network.
|
| GraphTheoryMetrics |
Class to deal with graph-theory metrics computation.
|
| GraphUtils |
Auxiliary static methods to work with graphs.
|
| GraphUtils.JGraphTUtils |
Auxiliary class to work with the graph library JGraphT.
|
| GraphUtils.JUNGUtils |
Auxiliary class to work with the graph library JUNG.
|
| GraphUtils.JUNGUtils.GraphPath<E> |
Class to represent a path in a Graph.
|
| IPUtils |
Class for destination-based routing (IP-like)
|
| MultiLayerUtils |
Class to deal with multilayer networks.
|
| NetworkPerformanceMetrics |
Class implementing different network metrics
|
| ResilienceUtils |
Provides a set of static methods which can be useful when dealing with network resilience.
|
| TrafficMatrixGenerationModels |
Set of methods implementing different traffic generation models based on traffic matrices.
|
| WDMUtils |
Class to deal with optical topologies including wavelength assignment and regenerator placement.
|