src/hugo/list_graph.h
changeset 904 b40afcf42a4d
parent 897 ef09eee53b09
child 905 5be029d19c98
equal deleted inserted replaced
21:d58684d8b276 22:ecbf2b74cd9f
    72     class NodeIt;
    72     class NodeIt;
    73     class EdgeIt;
    73     class EdgeIt;
    74     class OutEdgeIt;
    74     class OutEdgeIt;
    75     class InEdgeIt;
    75     class InEdgeIt;
    76 
    76 
    77     /// Creating map registries.
    77     // Create map registries.
    78     CREATE_MAP_REGISTRIES;
    78     CREATE_MAP_REGISTRIES;
    79     /// Creating node and edge maps.
    79     /// Create node and edge maps.
    80 
       
    81     /// \todo
       
    82     /// It apears in the documentation as if it were a function definition.
       
    83     CREATE_MAPS(ArrayMap);
    80     CREATE_MAPS(ArrayMap);
    84 
    81 
    85   public:
    82   public:
    86 
    83 
    87     ListGraph() 
    84     ListGraph() 
   440   {
   437   {
   441   public:
   438   public:
   442 
   439 
   443     typedef SymListGraph Graph;
   440     typedef SymListGraph Graph;
   444 
   441 
   445     /// Creating symmetric map registry.
   442     // Create symmetric map registry.
   446     CREATE_SYM_EDGE_MAP_REGISTRY;
   443     CREATE_SYM_EDGE_MAP_REGISTRY;
   447     /// Creating symmetric edge map.
   444     // Create symmetric edge map.
   448     CREATE_SYM_EDGE_MAP(ArrayMap);
   445     CREATE_SYM_EDGE_MAP(ArrayMap);
   449 
   446 
   450     SymListGraph() : ListGraph() { }
   447     SymListGraph() : ListGraph() { }
   451     SymListGraph(const ListGraph &_g) : ListGraph(_g) { }
   448     SymListGraph(const ListGraph &_g) : ListGraph(_g) { }
   452     ///Adds a pair of oppositely directed edges to the graph.
   449     ///Adds a pair of oppositely directed edges to the graph.
   525     class NodeIt;
   522     class NodeIt;
   526     class EdgeIt;
   523     class EdgeIt;
   527     class OutEdgeIt;
   524     class OutEdgeIt;
   528     class InEdgeIt;
   525     class InEdgeIt;
   529     
   526     
   530     /// Creating node map registry.
   527     // Create node map registry.
   531     CREATE_NODE_MAP_REGISTRY;
   528     CREATE_NODE_MAP_REGISTRY;
   532     /// Creating node maps.
   529     // Create node maps.
   533     CREATE_NODE_MAP(ArrayMap);
   530     CREATE_NODE_MAP(ArrayMap);
   534 
   531 
   535     /// Creating empty map structure for edges.
   532     /// Creating empty map structure for edges.
   536     template <typename Value>
   533     template <typename Value>
   537     class EdgeMap {
   534     class EdgeMap {
   876     class EdgeIt;
   873     class EdgeIt;
   877     class OutEdgeIt;
   874     class OutEdgeIt;
   878     class InEdgeIt;
   875     class InEdgeIt;
   879 
   876 
   880 
   877 
   881     /// Creates edge map registry.
   878     // Create edge map registry.
   882     CREATE_EDGE_MAP_REGISTRY;
   879     CREATE_EDGE_MAP_REGISTRY;
   883     /// Creates edge maps.
   880     // Create edge maps.
   884     CREATE_EDGE_MAP(ArrayMap);
   881     CREATE_EDGE_MAP(ArrayMap);
   885 
   882 
   886     /// Imports node maps from the NodeGraphType.
   883     // Import node maps from the NodeGraphType.
   887     IMPORT_NODE_MAP(NodeGraphType, graph.G, EdgeSet, graph);
   884     IMPORT_NODE_MAP(NodeGraphType, graph.G, EdgeSet, graph);
   888     
   885     
   889     
   886     
   890   public:
   887   public:
   891 
   888