Changeset 593:b83b36ee7f10 in lemon0.x
 Timestamp:
 05/10/04 10:25:10 (17 years ago)
 Branch:
 default
 Phase:
 public
 Convert:
 svn:c9d7d8f590d60310b91f818b3a526b0e/lemon/trunk@772
 Location:
 src
 Files:

 2 edited
Legend:
 Unmodified
 Added
 Removed

src/hugo/graph_wrapper.h
r589 r593 466 466 /// Returns true if \c n is hidden. 467 467 bool hidden(const Edge& e) const { return !(*edge_filter_map)[e]; } 468 469 /// This is a linear time operation an works only if 470 /// NodeIt is defined. 471 int nodeNum() const { 472 int i=0; 473 NodeIt n; 474 for (this>first(n); this>valid(n); this>next(n)) ++i; 475 return i; 476 } 477 478 /// This is a linear time operation and works only if 479 /// EdgeIt is defined. 480 int edgeNum() const { 481 int i=0; 482 EdgeIt e; 483 for (this>first(e); this>valid(e); this>next(e)) ++i; 484 return i; 485 } 486 468 487 }; 469 488 … … 1319 1338 } //namespace hugo 1320 1339 1321 1322 1340 #endif //HUGO_GRAPH_WRAPPER_H 1323 1341 
src/work/jacint/graph_gen.h
r558 r593 62 62 } 63 63 64 /// Generates a complete graph in the undirected sense 65 /// with n nodes and m edges. 66 /// Before generating the random graph, \c g.clear() is called. 67 template<typename Graph> 68 void completeGraph(Graph& g, int n) { 69 g.clear(); 70 std::vector<typename Graph::Node> nodes; 71 for (int i=0; i<n; ++i) 72 nodes.push_back(g.addNode()); 73 for (int i=0; i<n; ++i) 74 for (int j=i+1; j<n; ++j) 75 g.addEdge(nodes[i], nodes[j]); 76 } 77 64 78 } //namespace hugo
Note: See TracChangeset
for help on using the changeset viewer.