Changeset 12:0810e3fc64a4 in lemon-0.x for src/work/marci_graph_demo.cc

Timestamp:

01/12/04 12:49:16 (21 years ago)

Author:

marci

Branch:

default

Phase:

public

Convert:

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

Message:

.

File:

• src/work/marci_graph_demo.cc (modified) (2 diffs)

src/work/marci_graph_demo.cc

@@ -30 +30 @@
 
   std::cout << "We construct a directed graph on the node set {0,1,2,...,7}," <<std::endl << "i-->j is arc iff i<j and (i+j)%3." << std::endl;
-  std::cout << "number of nodes: " << number_of<each_node_iterator>(G.first_node()) << std::endl;
+  std::cout << "number of nodes: " << number_of(G.first_node()) << std::endl;
 
   for(each_node_iterator i=G.first_node(); i.is_valid(); ++i) {
@@ -39 +39 @@
     }
     std::cout << std::endl; 
+
+    std::cout<< " ";
+    for(out_edge_iterator j=G.first_out_edge(i); j.is_valid(); ++j) { 
+      std::cout << G.a_node(j) << "->" << G.b_node(j) << " "; } 
+    std::cout<<std::endl;
+
     std::cout << " indegree: (in_edge_oterator) " << number_of(G.first_in_edge(i)) << " ";
     for(in_edge_iterator j=G.first_in_edge(i); j.is_valid(); ++j) { 
       std::cout << j << " "; } 
     std::cout << std::endl;
+
+    std::cout<< " ";
+    for(in_edge_iterator j=G.first_in_edge(i); j.is_valid(); ++j) { 
+      std::cout << G.a_node(j) << "->" << G.b_node(j) << " "; } 
+    std::cout<<std::endl;
+
     std::cout << " degree: (sym_edge_iterator) " << number_of(G.first_sym_edge(i)) << " ";
     for(sym_edge_iterator j=G.first_sym_edge(i); j.is_valid(); ++j) { 
       std::cout << j << " "; } 
+    std::cout<<std::endl;
+
+    std::cout<< " ";
+    for(sym_edge_iterator j=G.first_sym_edge(i); j.is_valid(); ++j) { 
+      std::cout << G.a_node(j) << "->" << G.b_node(j) << " "; } 
     std::cout<<std::endl;
   }