| _bloom_edges | libgexf::Graph | [protected] |
| _edges | libgexf::Graph | [protected] |
| _edges_properties | libgexf::Graph | [protected] |
| _lock_flag | libgexf::Graph | [protected] |
| _nodes | libgexf::Graph | [protected] |
| _reverse_edges | libgexf::Graph | [protected] |
| _rlock_count | libgexf::Graph | [protected] |
| 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) | libgexf::Graph | |
| addNode(const libgexf::t_id id) | libgexf::Graph | |
| clear() | libgexf::Graph | |
| clearEdges(const libgexf::t_id node_id) | libgexf::Graph | |
| clearEdges() | libgexf::Graph | |
| containsEdge(const libgexf::t_id source_id, const libgexf::t_id target_id) const | libgexf::Graph | |
| containsNode(const libgexf::t_id id) const | libgexf::Graph | |
| DirectedGraph() (defined in libgexf::DirectedGraph) | libgexf::DirectedGraph | |
| DirectedGraph(const DirectedGraph &orig) | libgexf::DirectedGraph | |
| EdgeIter (defined in libgexf::Graph) | libgexf::Graph | [friend] |
| getDegree(const libgexf::t_id node_id) const | libgexf::Graph | |
| getEdge(const libgexf::t_id source_id, const libgexf::t_id target_id) const | libgexf::Graph | |
| getEdgeCount() const | libgexf::Graph | |
| getEdges() const | libgexf::Graph | |
| getInDegree(const libgexf::t_id node_id) const | libgexf::DirectedGraph | |
| getInEdges(const libgexf::t_id node_id) const | libgexf::DirectedGraph | |
| getNeighbors(const libgexf::t_id node_id) const | libgexf::Graph | |
| getNodeCount() const | libgexf::Graph | |
| getNodes() const | libgexf::Graph | |
| getOutDegree(const libgexf::t_id node_id) const | libgexf::DirectedGraph | |
| getOutEdges(const libgexf::t_id node_id) const | libgexf::DirectedGraph | |
| getPredecessors(const libgexf::t_id node_id) const | libgexf::DirectedGraph | |
| getSuccessors(const libgexf::t_id node_id) const | libgexf::DirectedGraph | |
| Graph() (defined in libgexf::Graph) | libgexf::Graph | |
| Graph(const Graph &orig) | libgexf::Graph | |
| isPredecessor(const libgexf::t_id node_id, const libgexf::t_id predecessor_id) const | libgexf::DirectedGraph | |
| isReadLock() | libgexf::Graph | |
| isSuccessor(const libgexf::t_id node_id, const libgexf::t_id successor_id) const | libgexf::DirectedGraph | |
| isUnlock() | libgexf::Graph | |
| isWriteLock() | libgexf::Graph | |
| NodeIter (defined in libgexf::Graph) | libgexf::Graph | [friend] |
| operator<< (defined in libgexf::Graph) | libgexf::Graph | [friend] |
| readLock() | libgexf::Graph | |
| readUnlock() | libgexf::Graph | |
| removeEdge(const libgexf::t_id source_id, const libgexf::t_id target_id) | libgexf::Graph | |
| removeInEdges(const libgexf::t_id target_id) | libgexf::DirectedGraph | |
| removeNode(const libgexf::t_id id) | libgexf::Graph | |
| removeOutEdges(const libgexf::t_id source_id) | libgexf::DirectedGraph | |
| writeLock() | libgexf::Graph | |
| writeUnlock() | libgexf::Graph | |
| ~DirectedGraph() (defined in libgexf::DirectedGraph) | libgexf::DirectedGraph | [virtual] |
| ~Graph() (defined in libgexf::Graph) | libgexf::Graph | [virtual] |
1.5.6