Interpretation of the topology structure as a undirected graph. More...
#include <undirectedgraph.h>
Inheritance diagram for libgexf::UndirectedGraph:
Public Member Functions | |
| UndirectedGraph (const UndirectedGraph &orig) | |
| Copy constructor. | |
 Public Member Functions inherited from libgexf::Graph | |
| Graph (const Graph &orig) | |
| Copy constructor. | |
| void | addNode (const libgexf::t_id id) |
| Add a node. More... | |
| void | addEdge (const libgexf::t_id id, const libgexf::t_id source_id, const libgexf::t_id target_id, const float weight=1.0, const libgexf::t_edge_type type=EDGE_UNDEF) |
| Add an edge. More... | |
| void | removeNode (const libgexf::t_id id) |
| Remove a node. More... | |
| void | removeEdge (const libgexf::t_id source_id, const libgexf::t_id target_id) |
| Remove an edge. More... | |
| bool | containsNode (const libgexf::t_id id) const |
| Test node existence. More... | |
| bool | containsEdge (const libgexf::t_id source_id, const libgexf::t_id target_id) const |
| Test edge existence. More... | |
| t_id | getEdge (const libgexf::t_id source_id, const libgexf::t_id target_id) const |
| Get the edge id. More... | |
| libgexf::NodeIter * | getNodes () const |
| Get all nodes. More... | |
| libgexf::EdgeIter * | getEdges () const |
| Get all edges. More... | |
| std::vector< libgexf::t_id > | getNeighbors (const libgexf::t_id node_id) const |
| Get node neighbors. More... | |
| unsigned int | getNodeCount () const |
| Count the nodes. More... | |
| unsigned int | getEdgeCount () const |
| Count the edges. More... | |
| unsigned int | getDegree (const libgexf::t_id node_id) const |
| Get node degree. More... | |
| void | clearEdges (const libgexf::t_id node_id) |
| Delete node links. More... | |
| void | clear () |
| Clear the graph. | |
| void | clearEdges () |
| Delete all edges. | |
| void | readLock () throw (libgexf::ReadLockException) |
| Set a lock on reading. More... | |
| void | readUnlock () |
| Unset a lock on reading. | |
| void | writeLock () throw (libgexf::WriteLockException) |
| Get a lock on writing. More... | |
| void | writeUnlock () |
| Unset a lock on writing. | |
| bool | isReadLock () |
| Test if a read lock exists. | |
| bool | isWriteLock () |
| Test if a write lock exists. | |
| bool | isUnlock () |
| Unset all locks. | |
Additional Inherited Members | |
| Protected Attributes inherited from libgexf::Graph | |
| std::set< t_id > | _nodes |
| std::map< t_id, std::map< t_id, t_id > > | _edges |
| std::map< t_id, std::set< t_id > > | _reverse_edges |
| std::set< t_id > | _bloom_edges |
| std::map< t_id, std::map< t_edge_property, t_edge_value > > | _edges_properties |
| unsigned short int | _rlock_count |
| char | _lock_flag |
| Flag used for determining the lock type: More... | |
Detailed Description
Interpretation of the topology structure as a undirected graph.
The documentation for this class was generated from the following files:
- libgexf/undirectedgraph.h
- libgexf/undirectedgraph.cpp
