diff -r 7c88989ea45b -r 3151a1026db9 src/work/marci_graph_concept.txt
--- a/src/work/marci_graph_concept.txt	Tue Jan 20 11:21:42 2004 +0000
+++ b/src/work/marci_graph_concept.txt	Tue Jan 20 17:39:13 2004 +0000
@@ -16,7 +16,6 @@
 
 marci_bfs.hh	      //bfs, tejesen kiserleti
 marci_graph_demo.cc  //peldaprogi a lisas graf hasznalatahoz
-marci_graph_traits.hh //alapertelmezett graph_traits
 marci_list_graph.hh  //list_graph megvalositas
 marci_max_flow.hh     //folyam, kiserleti
 marci_property_vector.hh //property vector megvalosites indexelt grafokhoz	
@@ -131,7 +130,7 @@
 
 node_iterator metodusai:
 node_iterator();
-bool is_valid();
+bool valid();
 void make_invalid();
 ezek nem tagfuggvenyek:
 friend bool operator==(const node_iterator&, const node_iterator&);
@@ -144,7 +143,7 @@
 
 edge_iterator metodusai:
 edge_iterator();
-bool is_valid();
+bool valid();
 void make_invalid();
 ezek nem tagfvek:
 friend bool operator==(const edge_iterator&, const edge_iterator&);
@@ -192,8 +191,8 @@
 metodusok:
 
 node_property_vector(graph_type&);
-void put(graph_traits<graph_type>::node_iterator, const T&);
-T get(graph_traits<graph_type>::node_iterator);
+void put(graph_type::node_iterator, const T&);
+T get(graph_type::node_iterator);
 
 Ugyanez edge_property_array-okkal
 
@@ -201,8 +200,8 @@
 class edge_property_vector;
 
 edge_property_vector(graph_type&);
-void put(graph_traits<graph_type>::edge_iterator, const T&);
-get(graph_traits<graph_type>::edge_iterator);
+void put(graph_type::edge_iterator, const T&);
+get(graph_type::edge_iterator);
 
  Ennyi nem javasolas utan, meg nehany szo.
  Alparral ugy gondoltuk, hogy az iterator 1 olyan egyszeru objetum legyen