equal
deleted
inserted
replaced
39 /// and one edge container. But they are not standard containers they |
39 /// and one edge container. But they are not standard containers they |
40 /// does not store values directly they are just key continars for more |
40 /// does not store values directly they are just key continars for more |
41 /// value containers which are the node and edge maps. |
41 /// value containers which are the node and edge maps. |
42 /// |
42 /// |
43 /// The graph's node and edge sets can be changed as we add or erase |
43 /// The graph's node and edge sets can be changed as we add or erase |
44 /// nodes and edges in the graph. Lemon would like to handle easily |
44 /// nodes and edges in the graph. LEMON would like to handle easily |
45 /// that the node and edge maps should contain values for all nodes or |
45 /// that the node and edge maps should contain values for all nodes or |
46 /// edges. If we want to check on every indicing if the map contains |
46 /// edges. If we want to check on every indicing if the map contains |
47 /// the current indicing key that cause a drawback in the performance |
47 /// the current indicing key that cause a drawback in the performance |
48 /// in the library. We use another solution we notify all maps about |
48 /// in the library. We use another solution we notify all maps about |
49 /// an alteration in the graph, which cause only drawback on the |
49 /// an alteration in the graph, which cause only drawback on the |