COIN-OR::LEMON - Graph Library

Changeset 1641:77f6ab7ad66f in lemon-0.x for demo/kruskal_demo.cc


Ignore:
Timestamp:
08/18/05 00:07:35 (15 years ago)
Author:
Alpar Juttner
Branch:
default
Phase:
public
Convert:
svn:c9d7d8f5-90d6-0310-b91f-818b3a526b0e/lemon/trunk@2154
Message:

Demos' documentations include the source.

File:
1 edited

Legend:

Unmodified
Added
Removed
  • demo/kruskal_demo.cc

    r1584 r1641  
    2121/// This demo program shows how to find a minimum weight spanning tree
    2222/// in a graph by using the Kruskal algorithm.
     23///
     24/// \include kruskal_demo.cc
    2325
    2426#include <iostream>
     
    124126    std::cout << g.id(tree_edge_vec[i]) << ";" ;
    125127  std::cout << std::endl;
    126   std::cout << "The size of the tree again is: "<< tree_edge_vec.size()<< std::endl;
     128  std::cout << "The size of the tree again is: "<< tree_edge_vec.size()
     129            << std::endl;
    127130
    128131 
Note: See TracChangeset for help on using the changeset viewer.