A vertex in an undirected network.
More...
#include <UndirectedVertex.h>
|
enum | EdgeType { INCOMING,
OUTGOING
} |
| Enum the identifies whether an edge is incoming or outgoing.
|
|
typedef boost::unordered_map< Vertex< V, E > *, boost::shared_ptr< E >, HashVertex< V, E > > | AdjListMap |
| Typedef for the adjacency list map that contains the other Vertices that this Vertex links to.
|
|
typedef AdjListMap::iterator | AdjListMapIterator |
|
boost::shared_ptr< E > | removeEdge (Vertex< V, E > *other, AdjListMap *adjMap) |
|
void | getItems (AdjListMap *adjMap, std::vector< V * > &out) |
|
void | edges (AdjListMap *adjMap, std::vector< boost::shared_ptr< E > > &out) |
|
boost::shared_ptr< V > | ptr |
|
template<typename V, typename E>
class repast::UndirectedVertex< V, E >
A vertex in an undirected network.
- Template Parameters
-
V | the vertex type |
E | the edge type. The edge type must be or extend RepastEdge. |
◆ addEdge()
template<typename V , typename E >
Adds an edge of the specified type between this Vertex and the specified vertex.
- Parameters
-
edge | the edge to add |
other | the other end of the edge |
type | the type of edge to add |
Implements repast::Vertex< V, E >.
◆ adjacent()
template<typename V , typename E >
Gets the Vertices adjacent to this Vertex.
- Parameters
-
[out] | the | vector where the adjacent vectors will be put |
Implements repast::Vertex< V, E >.
◆ edges()
template<typename V , typename E >
Gets all the edges of the specified type in which this Vertex participates and return them in out.
- Parameters
-
| type | the type of edges to get |
[out] | where | the edges will be put. |
Implements repast::Vertex< V, E >.
◆ findEdge()
template<typename V , typename E >
Finds the edge of the specified type between this Vertex and the specified vertex.
- Parameters
-
other | the other end of the edge |
type | the type of edge to remove |
- Returns
- the found edge, or 0.
Implements repast::Vertex< V, E >.
◆ inDegree()
template<typename V , typename E >
◆ outDegree()
template<typename V , typename E >
◆ predecessors()
template<typename V , typename E >
◆ removeEdge()
template<typename V , typename E >
Removes the edge of the specified type between this Vertex and the specified Vertex.
- Parameters
-
other | the other end of the edge |
type | the type of edge to remove |
- Returns
- the removed edge if such an edge was found, otherwise 0.
Implements repast::Vertex< V, E >.
◆ successors()
template<typename V , typename E >
The documentation for this class was generated from the following file: