20 #include <unordered_map>    32 class Edges : 
private std::unordered_map<int, Edge>
    39     using std::unordered_map<int, Edge>::at;
    40     using std::unordered_map<int, Edge>::begin;
    41     using std::unordered_map<int, Edge>::cbegin;
    42     using std::unordered_map<int, Edge>::end;
    43     using std::unordered_map<int, Edge>::cend;
    44     using std::unordered_map<int, Edge>::iterator;
    45     using std::unordered_map<int, Edge>::const_iterator;
    46     using std::unordered_map<int, Edge>::empty;
    47     using std::unordered_map<int, Edge>::size;
 BaseNode implementation for directed nodes. 
Definition: node_p.h:197
BaseNode implementation for undirected nodes. 
Definition: node_p.h:170
Definition: abstractgraph.h:29
Abstract base class for graph plugins. 
Definition: abstractgraph.h:54
An Edge container. 
Definition: edges.h:32