Changeset 1959:264811b995f3 in lemon-0.x
- Timestamp:
- 02/06/06 10:10:43 (18 years ago)
- Branch:
- default
- Phase:
- public
- Convert:
- svn:c9d7d8f5-90d6-0310-b91f-818b3a526b0e/lemon/trunk@2535
- Files:
-
- 3 edited
Legend:
- Unmodified
- Added
- Removed
-
demo/coloring.cc
r1956 r1959 21 21 ///\brief Coloring of a graph. 22 22 /// 23 /// This example shows how can we color the nodes of a plan graph efficiently23 /// This example shows how can we color the nodes of a planar graph efficiently 24 24 /// with six colors. 25 25 /// … … 49 49 typedef Graph::IncEdgeIt IncEdgeIt; 50 50 51 std::cout << "Six coloring of a plan graph" << std::endl;51 std::cout << "Six coloring of a planar graph" << std::endl; 52 52 std::cout << "Input file: coloring.lgf" << std::endl; 53 53 std::cout << "Output file: coloring.eps" << std::endl; -
demo/min_route.cc
r1956 r1959 32 32 /// \ingroup demos 33 33 /// \file 34 /// \brief Minimal route on a plan graph with eucledian distances.34 /// \brief Minimal route on a planar graph with eucledian distances. 35 35 /// 36 /// Minimal route on a plan graph with eucledian distances.36 /// Minimal route on a planar graph with eucledian distances. 37 37 /// 38 38 /// \include min_route.cc -
doc/graph_io.dox
r1909 r1959 98 98 \code 99 99 @attributes 100 title "Four colored plan graph"100 title "Four colored planar graph" 101 101 author "Balazs DEZSO" 102 102 copyright "Lemon Library"
Note: See TracChangeset
for help on using the changeset viewer.