Changeset 1400:6b79d93e812f in lemon
 Timestamp:
 10/17/18 17:52:11 (3 years ago)
 Branch:
 default
 Phase:
 public
 Files:

 2 edited
Legend:
 Unmodified
 Added
 Removed

lemon/planarity.h
r1399 r1400 2398 2398 void run(const EmbeddingMap& embedding) { 2399 2399 typedef SmartEdgeSet<Graph> AuxGraph; 2400 2401 if (countNodes(_graph) < 3) { 2402 int y = 0; 2403 for (typename Graph::NodeIt n(_graph); n != INVALID; ++n) { 2404 _point_map[n].x = 0; 2405 _point_map[n].y = y++; 2406 } 2407 return; 2408 } 2400 2409 2401 2410 if (3 * countNodes(_graph)  6 == countEdges(_graph)) { 
test/planarity_test.cc
r1399 r1400 31 31 using namespace lemon::dim2; 32 32 33 const int lgfn = 4;33 const int lgfn = 8; 34 34 const std::string lgf[lgfn] = { 35 "@nodes\n" 36 "label\n" 37 "@edges\n" 38 " label\n", 39 40 "@nodes\n" 41 "label\n" 42 "0\n" 43 "@edges\n" 44 " label\n", 45 46 "@nodes\n" 47 "label\n" 48 "0\n" 49 "1\n" 50 "@edges\n" 51 " label\n" 52 "0 1 0\n", 53 54 "@nodes\n" 55 "label\n" 56 "0\n" 57 "1\n" 58 "2\n" 59 "@edges\n" 60 " label\n" 61 "0 1 0\n" 62 "1 2 1\n" 63 "2 0 2\n", 64 35 65 "@nodes\n" 36 66 "label\n" … … 137 167 } 138 168 } 139 check(face_num + countNodes(graph)  countConnectedComponents(graph) == 140 countEdges(graph) + 1, "Euler test does not passed"); 169 170 if (face_num != 0) { 171 check(face_num + countNodes(graph)  countConnectedComponents(graph) == 172 countEdges(graph) + 1, "Euler test does not passed"); 173 } 141 174 } 142 175
Note: See TracChangeset
for help on using the changeset viewer.