1.1 --- a/src/work/marci_graph_concept.txt	Tue Dec 30 13:59:08 2003 +0000
     1.2 +++ b/src/work/marci_graph_concept.txt	Fri Jan 09 14:57:01 2004 +0000
     1.3 @@ -190,6 +190,8 @@
     1.4  metodusok:
     1.5  
     1.6  node_property_vector(graph_type&)
     1.7 +node_property_vector(graph_type&, T a)
     1.8 +fill constructor, a-val kitolt
     1.9  void put(graph_traits<graph_type>::node_iterator, const T&)
    1.10  T get(graph_traits<graph_type>::node_iterator)
    1.11  
    1.12 @@ -199,6 +201,8 @@
    1.13  class edge_property_vector
    1.14  
    1.15  edge_property_vector(graph_type&)
    1.16 +edge_property_vector(graph_type&, T a)
    1.17 +fill constructor, a-val kitolt
    1.18  void put(graph_traits<graph_type>::edge_iterator, const T&)
    1.19  get(graph_traits<graph_type>::edge_iterator)
    1.20  
    1.21 @@ -212,4 +216,7 @@
    1.22  at a propertyket az algoritmusoknak, algoritmus-objektumoknak. 
    1.23  Errol majd kesobb.
    1.24  
    1.25 -marci@cs.elte.hu
    1.26 \ No newline at end of file
    1.27 +marci@cs.elte.hu
    1.28 +
    1.29 +
    1.30 +