#include <ctopo.h>
Inheritance diagram for cTopology::
Public Methods | |
Constructors, destructor, assignment | |
cTopology (const char *name=NULL) | |
cTopology (const cTopology &topo) | |
virtual | ~cTopology () |
cTopology& | operator= (const cTopology &topo) |
Redefined cObject member functions. | |
virtual cObject* | dup () const |
virtual void | info (char *buf) |
virtual int | netPack () |
virtual int | netUnpack () |
Extracting the topology from a network. | |
extract...() functions build topology from the model. User can select which modules to include. All connections between those modules will be in the topology. Connections can cross compound module boundaries. | |
void | extractFromNetwork (int(*selfunc)(cModule *,void *), void *data=NULL) |
void | extractByModuleType (const char *type1,...) |
void | extractByParameter (const char *parname, cPar *value=NULL) |
void | clear () |
Functions to examine topology by hand. | |
Users also need to rely on Node and Link member functions to explore the graph stored in the object. | |
int | nodes () const |
Node* | node (int i) |
Node* | nodeFor (cModule *mod) |
Algorithms to find shortest paths. | |
To be implemented:
| |
void | unweightedSingleShortestPathsTo (Node *target) |
Node* | targetNode () const |
A cTopology object stores an abstract representation of the network in graph form:
You can specify which modules (either simple or compound) you want to include in the graph. The graph will include all connections among the selected modules. In the graph, all nodes are at the same level, there's no submodule nesting. Connections which span across compound module boundaries are also represented as one graph edge. Graph edges are directed, just as module gates are.
|
Constructor. |
|
Copy constructor. |
|
Destructor. |
|
Deletes the topology stored in the object. |
|
Creates and returns an exact copy of this object. See cObject for more details. Reimplemented from cObject. |
|
Extracts model topology by module type (classnames). Includes into the graph all modules whose className() is one of the strings listed as arguments. The argument list must be terminated by NULL. |
|
Extracts model topology by parameter value. Includes into the graph modules which have a parameter with the given name and (optionally) the given value. |
|
Extracts model topology by a user-defined criteria. Includes into the graph modules for which the passed selfunc() returns nonzero. |
|
Produces a one-line description of object contents into the buffer passed as argument. See cObject for more details. Reimplemented from cObject. |
|
Serializes the object into a PVM or MPI send buffer. Used by the simulation kernel for parallel execution. See cObject for more details. Reimplemented from cObject. |
|
Deserializes the object from a PVM or MPI receive buffer Used by the simulation kernel for parallel execution. See cObject for more details. Reimplemented from cObject. |
|
Returns pointer to the ith node in the graph. Node's methods can be used to further examine the node's connectivity, etc. |
|
Returns the graph node which corresponds to the given module in the network. If no graph node corresponds to the module, the method returns NULL. This method assumes that the topology corresponds to the network, that is, it was probably created with one of the extract...() functions. |
|
Returns the number of nodes in the graph. |
|
Assignment operator. The name member doesn't get copied; see cObject's operator=() for more details. |
|
Returns the node that was passed to the most recently called shortest path finding function. |
|
Apply the Dijkstra algorithm to find all shortest paths to the given graph node. The paths found can be extracted via Node's methods. |