libgexf::DirectedGraph Class Reference
Interpretation of the topology structure as a directed graph. More...
#include <directedgraph.h>
Inheritance diagram for libgexf::DirectedGraph:
Public Member Functions | |
| DirectedGraph (const DirectedGraph &orig) | |
| Copy constructor. | |
| void | removeInEdges (const libgexf::t_id target_id) |
| Remove incoming edges from a node. | |
| void | removeOutEdges (const libgexf::t_id source_id) |
| Remove outgoing edges from a node. | |
| std::vector< libgexf::t_id > | getInEdges (const libgexf::t_id node_id) const |
| Get incoming edges from a node. | |
| std::vector< libgexf::t_id > | getOutEdges (const libgexf::t_id node_id) const |
| Get outgoing edges from a node. | |
| std::vector< libgexf::t_id > | getSuccessors (const libgexf::t_id node_id) const |
| Get node successors. | |
| std::vector< libgexf::t_id > | getPredecessors (const libgexf::t_id node_id) const |
| Get node predecessors. | |
| unsigned int | getInDegree (const libgexf::t_id node_id) const |
| Get indegree value. | |
| unsigned int | getOutDegree (const libgexf::t_id node_id) const |
| Get outdegree value. | |
| bool | isSuccessor (const libgexf::t_id node_id, const libgexf::t_id successor_id) const |
| Test a possible successor. | |
| bool | isPredecessor (const libgexf::t_id node_id, const libgexf::t_id predecessor_id) const |
| Test a possible predecessor. | |
Detailed Description
Interpretation of the topology structure as a directed graph.Member Function Documentation
| void libgexf::DirectedGraph::removeInEdges | ( | const libgexf::t_id | target_id | ) |
Remove incoming edges from a node.
- Parameters:
-
target_id : node ID
| void libgexf::DirectedGraph::removeOutEdges | ( | const libgexf::t_id | source_id | ) |
Remove outgoing edges from a node.
- Parameters:
-
source_id : node ID
| std::vector< t_id > libgexf::DirectedGraph::getInEdges | ( | const libgexf::t_id | node_id | ) | const |
Get incoming edges from a node.
- Parameters:
-
node_id : node ID
- Returns:
- Vector of IDs of incoming edges
| std::vector< t_id > libgexf::DirectedGraph::getOutEdges | ( | const libgexf::t_id | node_id | ) | const |
Get outgoing edges from a node.
- Parameters:
-
node_id : node ID
- Returns:
- Vector of IDs of outgoing edges
| std::vector< t_id > libgexf::DirectedGraph::getSuccessors | ( | const libgexf::t_id | node_id | ) | const |
Get node successors.
- Parameters:
-
node_id : node ID
- Returns:
- Vector of node IDs
| std::vector< t_id > libgexf::DirectedGraph::getPredecessors | ( | const libgexf::t_id | node_id | ) | const |
Get node predecessors.
- Parameters:
-
node_id : node ID
- Returns:
- Vector of node IDs
| unsigned int libgexf::DirectedGraph::getInDegree | ( | const libgexf::t_id | node_id | ) | const |
Get indegree value.
- Parameters:
-
node_id : node ID
- Returns:
- indegree value
| unsigned int libgexf::DirectedGraph::getOutDegree | ( | const libgexf::t_id | node_id | ) | const |
Get outdegree value.
- Parameters:
-
node_id : node ID
- Returns:
- outdegree value
| bool libgexf::DirectedGraph::isSuccessor | ( | const libgexf::t_id | node_id, | |
| const libgexf::t_id | successor_id | |||
| ) | const |
Test a possible successor.
Check if the successor_id is a successor of the node node_id.
- Parameters:
-
node_id : node ID successor_id : node ID of the tested successor
- Returns:
- true if successor_id is a successor of node_id
| bool libgexf::DirectedGraph::isPredecessor | ( | const libgexf::t_id | node_id, | |
| const libgexf::t_id | predecessor_id | |||
| ) | const |
Test a possible predecessor.
Check if the predecessor_id is a predecessor of the node node_id.
- Parameters:
-
node_id : node ID predecessor_id : node ID of the tested predecessor
- Returns:
- true if predecessor_id is a predecessor of node_id
The documentation for this class was generated from the following files:
- libgexf/directedgraph.h
- libgexf/directedgraph.cpp
