equal
deleted
inserted
replaced
42 /// The graph's node and edge sets can be changed as we add or erase |
42 /// The graph's node and edge sets can be changed as we add or erase |
43 /// nodes and edges in the graph. Lemon would like to handle easily |
43 /// nodes and edges in the graph. Lemon would like to handle easily |
44 /// that the node and edge maps should contain values for all nodes or |
44 /// that the node and edge maps should contain values for all nodes or |
45 /// edges. If we want to check on every indicing if the map contains |
45 /// edges. If we want to check on every indicing if the map contains |
46 /// the current indicing key that cause a drawback in the performance |
46 /// the current indicing key that cause a drawback in the performance |
47 /// in the library. We use an other solution we notify all maps about |
47 /// in the library. We use another solution we notify all maps about |
48 /// an alteration in the graph, which cause only drawback on the |
48 /// an alteration in the graph, which cause only drawback on the |
49 /// alteration of the graph. |
49 /// alteration of the graph. |
50 /// |
50 /// |
51 /// This class provides an interface to the container. The \e first() and \e |
51 /// This class provides an interface to the container. The \e first() and \e |
52 /// next() member functions make possible to iterate on the keys of the |
52 /// next() member functions make possible to iterate on the keys of the |