Bonjour
MErci pour vôtre aide .

Je voulais seulement vous demander vôtre aide sur les commentaires du code MErci d'avance pour vôtre réactivité.


Code : Sélectionner tout - Visualiser dans une fenêtre à part
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
 
 
#include <boost/config.hpp> 
#include <iostream> 
#include <string> 
#include <boost/graph/push_relabel_max_flow.hpp> 
#include <boost/graph/adjacency_list.hpp> 
#include <boost/graph/read_dimacs.hpp> 
#include <boost/graph/graph_utility.hpp> 
 
// Use a DIMACS network flow file as stdin. 
// max_flow < max_flow.dat 
// 
// Sample output: 
//  c  The total flow: 
//  s 13 
// 
//  c flow values: 
//  f 0 6 3 
//  f 0 1 6 
//  f 0 2 4 
//  f 1 5 1 
//  f 1 0 0 
//  f 1 3 5 
//  f 2 4 4 
//  f 2 3 0 
//  f 2 0 0 
//  f 3 7 5 
//  f 3 2 0 
//  f 3 1 0 
//  f 4 5 4 
//  f 4 6 0 
//  f 5 4 0 
//  f 5 7 5 
//  f 6 7 3 
//  f 6 4 0 
//  f 7 6 0 
//  f 7 5 0 
 
int 
main() 
{ 
  using namespace boost; 
 
  typedef adjacency_list_traits<vecS, vecS, directedS> Traits; 
  typedef adjacency_list<listS, vecS, directedS, 
property<vertex_name_t, std::string>,      
 
                                     [b][u]Ca sert à koi property<vertex..[/u] 
 
  property<edge_capacity_t, long, 
  property<edge_residual_capacity_t, long, 
  property<edge_reverse_t, Traits::edge_descriptor> > > > Graph; 
 
  Graph g; 
 
  property_map<Graph, edge_capacity_t>::type 
    capacity = get(edge_capacity, g); 
  property_map<Graph, edge_reverse_t>::type 
    rev = get(edge_reverse, g); 
  property_map<Graph, edge_residual_capacity_t>::type 
    residual_capacity = get(edge_residual_capacity, g); 
 
  Traits::vertex_descriptor s, t;                             // ça c'est bien les Sommets  :?: 
  read_dimacs_max_flow(g, capacity, rev, s, t); 
 
  long flow; 
#if defined(BOOST_MSVC) && BOOST_MSVC <= 1300 // C'est le nombre de koi 
 
  // Use non-named parameter version 
  property_map<Graph, vertex_index_t>::type 
    indexmap = get(vertex_index, g); 
  flow = push_relabel_max_flow(g, s, t, capacity, residual_capacity, rev, indexmap); 
#else 
  flow = push_relabel_max_flow(g, s, t); 
#endif 
 
  std::cout << "c  The total flow:" << std::endl; // Std ça sert à koi 
  std::cout << "s " << flow << std::endl << std::endl; 
 
  std::cout << "c flow values:" << std::endl; 
  graph_traits<Graph>::vertex_iterator u_iter, u_end; 
  graph_traits<Graph>::out_edge_iterator ei, e_end; 
  for (tie(u_iter, u_end) = vertices(g); u_iter != u_end; ++u_iter) 
    for (tie(ei, e_end) = out_edges(*u_iter, g); ei != e_end; ++ei) 
      if (capacity[*ei] > 0) 
        std::cout << "f " << *u_iter << " " << target(*ei, g) << " " 
                  << (capacity[*ei] - residual_capacity[*ei]) << std::endl; 
 
  return 0; 
} 
[u][/u][/b]
[/code]