1.1 --- a/src/work/marci_graph_concept.txt Tue Jan 20 11:21:42 2004 +0000
1.2 +++ b/src/work/marci_graph_concept.txt Tue Jan 20 17:39:13 2004 +0000
1.3 @@ -16,7 +16,6 @@
1.4
1.5 marci_bfs.hh //bfs, tejesen kiserleti
1.6 marci_graph_demo.cc //peldaprogi a lisas graf hasznalatahoz
1.7 -marci_graph_traits.hh //alapertelmezett graph_traits
1.8 marci_list_graph.hh //list_graph megvalositas
1.9 marci_max_flow.hh //folyam, kiserleti
1.10 marci_property_vector.hh //property vector megvalosites indexelt grafokhoz
1.11 @@ -131,7 +130,7 @@
1.12
1.13 node_iterator metodusai:
1.14 node_iterator();
1.15 -bool is_valid();
1.16 +bool valid();
1.17 void make_invalid();
1.18 ezek nem tagfuggvenyek:
1.19 friend bool operator==(const node_iterator&, const node_iterator&);
1.20 @@ -144,7 +143,7 @@
1.21
1.22 edge_iterator metodusai:
1.23 edge_iterator();
1.24 -bool is_valid();
1.25 +bool valid();
1.26 void make_invalid();
1.27 ezek nem tagfvek:
1.28 friend bool operator==(const edge_iterator&, const edge_iterator&);
1.29 @@ -192,8 +191,8 @@
1.30 metodusok:
1.31
1.32 node_property_vector(graph_type&);
1.33 -void put(graph_traits<graph_type>::node_iterator, const T&);
1.34 -T get(graph_traits<graph_type>::node_iterator);
1.35 +void put(graph_type::node_iterator, const T&);
1.36 +T get(graph_type::node_iterator);
1.37
1.38 Ugyanez edge_property_array-okkal
1.39
1.40 @@ -201,8 +200,8 @@
1.41 class edge_property_vector;
1.42
1.43 edge_property_vector(graph_type&);
1.44 -void put(graph_traits<graph_type>::edge_iterator, const T&);
1.45 -get(graph_traits<graph_type>::edge_iterator);
1.46 +void put(graph_type::edge_iterator, const T&);
1.47 +get(graph_type::edge_iterator);
1.48
1.49 Ennyi nem javasolas utan, meg nehany szo.
1.50 Alparral ugy gondoltuk, hogy az iterator 1 olyan egyszeru objetum legyen