Context Navigation

Changes between Initial Version and Version 1 of Ticket #190

Timestamp:

01/05/09 17:29:26 (16 years ago)

Author:

Peter Kovacs

Comment:

I checked the graph adaptors and they all conform to this concept, so I see no reason for not adding this restriction to the graph concepts.

What do you think?

If we accept this idea, the following modifications should be made:

concepts/graph.h, concepts/digraph.h
- it should be checked in the concept checking classes
- it should noted in the documentation of the graph concepts
list_graph.h, smart_graph.h, full_graph.h, grid_graph.h, hypercube_graph.h
- remove the comments saying: "It also has an important extra feature that its maps are real reference maps."
algorithm classes that use internal maps
- check the writing operations of internal maps using set() and modify them to use the reference map syntax if it is simplier or possibly more efficient (e.g. map[i]++ instead of map.set(i, map[i] + 1)).

-                      initial
+                      v1
 Should we state in the graph structure concepts that node and arc/edge maps must be reference maps for '''all''' graph types?
+It would make writing a general algorithm easier and more convenient since we have to use `set()` functions instead of `operator[]` only for the "external" map types, and all the "internal" maps, which are created by the algorithm could be used as reference maps.
+Maybe it could also improve the efficiency in some cases, but it is not clear and wasn't be tested.
+Would this rule cause significant problems?
+It would make writing a general algorithm easier and more convenient since we would have to use `set()` functions instead of `operator[]` only for the "external" map types, and all the "internal" maps, which are created by the algorithm could be used as reference maps.
+Maybe it could also improve the efficiency in some cases, but it is not clear and wasn't tested.