Package | Description |
---|---|
com.net2plan.interfaces.networkDesign |
Provides a set of classes and interfaces for the network design tool.
|
com.net2plan.libraries |
Provides a set of useful libraries to develop algorithms and reports.
|
Modifier and Type | Class and Description |
---|---|
class |
Demand
This class contains a representation of a unicast demand.
|
class |
Link
This class contains a representation of a link.
|
class |
MulticastDemand
This class contains a representation of a multicast demand.
|
class |
MulticastTree
This class contains a representation of a unidirectional multicast tree, an structure used to carry traffic from multicast demands.
|
class |
NetPlan
Class defining a complete multi-layer network structure.
|
class |
NetworkLayer
This class contains a representation of a network layer.
|
class |
Node
This class contains a representation of a node.
|
class |
ProtectionSegment
This class contains a representation of a protection segment.
|
class |
Route
This class contains a representation of a unidirectional route, an structure used to carry traffic of unicast demands at a layer,
when the layer routing type is source routing.
|
class |
SharedRiskGroup
This class contains a representation of a Shared Risk Group (SRG).
|
Modifier and Type | Method and Description |
---|---|
NetworkElement |
NetPlan.getNetworkElement(long id)
Return the network element with the given unique id.
|
static NetworkElement |
NetPlan.getNetworkElementByAttribute(Collection<? extends NetworkElement> listOfElements,
String attribute,
String value)
Returns the first network element among the ones passed as input parameters, that has the given key-value as attribute.
|
Modifier and Type | Method and Description |
---|---|
static Map<NetworkElement,String> |
NetPlan.getAttributes(Collection<? extends NetworkElement> collection,
String attribute)
Returns the values of a given attribute for all the provided network elements.
|
static Collection<? extends NetworkElement> |
NetPlan.getNetworkElementsByAttribute(Collection<? extends NetworkElement> listOfElements,
String attribute,
String value)
Returns all the network elements among the ones passed as input parameters, that have the given key-value as attribute.
|
Modifier and Type | Method and Description |
---|---|
static Map<NetworkElement,String> |
NetPlan.getAttributes(Collection<? extends NetworkElement> collection,
String attribute)
Returns the values of a given attribute for all the provided network elements.
|
static Collection<Long> |
NetPlan.getIds(Collection<? extends NetworkElement> collection)
Returns the unique ids of the provided network elements.
|
static Collection<Integer> |
NetPlan.getIndexes(Collection<? extends NetworkElement> collection)
Returns the indexes of the provided network elements.
|
static NetworkElement |
NetPlan.getNetworkElementByAttribute(Collection<? extends NetworkElement> listOfElements,
String attribute,
String value)
Returns the first network element among the ones passed as input parameters, that has the given key-value as attribute.
|
static Collection<? extends NetworkElement> |
NetPlan.getNetworkElementsByAttribute(Collection<? extends NetworkElement> listOfElements,
String attribute,
String value)
Returns all the network elements among the ones passed as input parameters, that have the given key-value as attribute.
|
DoubleMatrix1D |
NetPlan.getVectorAttributeValues(Collection<? extends NetworkElement> collection,
String attributeKey)
Retuns a vector with the values of all given network elements for the given attribute key.
|
void |
NetPlan.setVectorAttributeValues(Collection<? extends NetworkElement> collection,
String attributeKey,
DoubleMatrix1D values)
Sets the given attributes values to all the given network elements.
|
Modifier and Type | Method and Description |
---|---|
static DoubleMatrix2D |
GraphUtils.getAdjacencyMatrix(List<Node> nodes,
List<? extends NetworkElement> linkMap)
Given a map of links, it computes the adjacency matrix.
|
static DoubleMatrix2D |
GraphUtils.getIncidenceMatrix(List<Node> nodes,
List<? extends NetworkElement> elements)
Given a list of Network Elements, it computes the node-network element incidence matrix.
|
static DoubleMatrix2D |
GraphUtils.getIncomingIncidenceMatrix(List<Node> nodes,
List<? extends NetworkElement> elements)
Given a list of Network Element, it computes the node-network element incoming incidence matrix.
|
static DoubleMatrix2D |
GraphUtils.getOutgoingIncidenceMatrix(List<Node> nodes,
List<? extends NetworkElement> elements)
Given a list of Network elements, it computes the node-network element outgoing incidence matrix.
|
static boolean |
GraphUtils.isWeightedBidirectional(List<Node> nodes,
List<? extends NetworkElement> elements,
DoubleMatrix1D linkCostMap)
Checks whether the physical topology has the same number of links/demands between each node pair in both directions (assuming multi-digraphs) and same weights per direction.
|