20 #include <unordered_map>    32 class Nodes : 
private std::unordered_map<int, Node>
    35     friend class Experiment;
    39     using std::unordered_map<int, Node>::at;
    40     using std::unordered_map<int, Node>::begin;
    41     using std::unordered_map<int, Node>::cbegin;
    42     using std::unordered_map<int, Node>::end;
    43     using std::unordered_map<int, Node>::cend;
    44     using std::unordered_map<int, Node>::iterator;
    45     using std::unordered_map<int, Node>::const_iterator;
    46     using std::unordered_map<int, Node>::empty;
    47     using std::unordered_map<int, Node>::size;
 A collection of utility functions for creating and saving nodes. 
Definition: nodes_p.h:32
A Node container. 
Definition: nodes.h:32
Definition: abstractgraph.h:29
Abstract base class for graph plugins. 
Definition: abstractgraph.h:54