Changeset 19:3151a1026db9 in lemon-0.x for src/work/marci_graph_concept.txt

Timestamp:

01/20/04 18:39:13 (20 years ago)

Author:

marci

Branch:

default

Phase:

public

Convert:

svn:c9d7d8f5-90d6-0310-b91f-818b3a526b0e/lemon/trunk@32

Message:

* empty log message *

File:

• src/work/marci_graph_concept.txt (modified) (5 diffs)

src/work/marci_graph_concept.txt

@@ -17 +17 @@
 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
@@ -132 +131 @@
 node_iterator metodusai:
 node_iterator();
-bool is_valid();
+bool valid();
 void make_invalid();
 ezek nem tagfuggvenyek:
@@ -145 +144 @@
 edge_iterator metodusai:
 edge_iterator();
-bool is_valid();
+bool valid();
 void make_invalid();
 ezek nem tagfvek:
@@ -193 +192 @@
 
 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
@@ -202 +201 @@
 
 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.