computeTreeTest.cc

#include <boost/graph/adjacency_list.hpp>
#include <scil/core/cutTree.h>
#include<iostream>
#include<fstream>
#include<string>
#include <boost/graph/iteration_macros.hpp>

using namespace boost;

typedef adjacency_list<vecS,vecS,undirectedS> Graph;
typedef graph_traits<Graph>::edge_descriptor edge_descriptor;
typedef graph_traits<Graph>::vertex_descriptor vertex_descriptor;

int main(int argc, char** argv) {
  Graph G;

  std::map<vertex_descriptor, vertex_descriptor> p;
  std::map<vertex_descriptor, double> fl;
  std::map<edge_descriptor,double> cap;

  computeCutTree<Graph>(G, cap, p, fl );

  G = Graph(6);                         //  4 --- 5
  add_edge(0,1,G);  add_edge(0,2,G);    //  |     |
  add_edge(0,4,G);  add_edge(4,5,G);    //  o --- 1
  add_edge(5,1,G);  add_edge(1,3,G);    //  |     |
  add_edge(3,2,G);                      //  2 --- 3
  
  edge_descriptor e;
  BGL_FORALL_EDGES(e,G,Graph)
    cap[e] = 1;

  computeCutTree(G,cap,p,fl);

  // Output 
  cout << "The cut-tree has edges s--t with flow value f" << endl;
  cout << " s \t t \t f " << endl;
  cout << "----------------------------------" << endl;
  vertex_descriptor s;
  BGL_FORALL_VERTICES(s,G,Graph)
    cout << s << "\t" << p[s] << "\t" << fl[s] << endl;

  // Compute all flow values
  unsigned int t;
  double F[6][6];
  for( int s=0;s<6;s++ )
    for( int t=0;t<6;t++ )
      F[s][t]=0;
  

  for( unsigned int s=1;s<6;s++ ){
    t = p[s];
    F[s][t] = fl[s];
    F[t][s] = fl[s];
    for( unsigned int i=0;i<s;i++ ){
      if( i!=t ) {
        F[s][i] = min(F[s][t], F[t][i]); 
        F[i][s] = F[s][i];
      }
    }
  }

  cout << "\nall Flows:"<<endl;
  for( int t=0;t<6;t++ ) cout << "\t" << t;
  cout << endl << "\t------------------------------------------" << endl;
  for( int s=0;s<6;s++ ){    
    cout << "    "<< s << "\t| ";
    for( int t=0;t<6;t++ ){
      cout << F[s][t] << "\t";
    }
    cout << endl;
  }


}

---