GeezerVison is showing github.com — boost_graph/example/edge_property.cpp at develop · stdgraph/boost_graph

Expand file tree

edge_property.cpp

Copy path

More file actions

Latest commit

History

163 lines (137 loc) · 4.15 KB

edge_property.cpp

Copy path

File metadata and controls

163 lines (137 loc) · 4.15 KB

Raw

Copy raw file

Download raw file

Open symbols panel

Edit and raw actions

100

101

102

103

104

105

106

107

108

109

110

111

112

113

114

115

116

117

118

119

120

121

122

123

124

125

126

127

128

129

130

131

132

133

134

135

136

137

138

139

140

141

142

143

144

145

146

147

148

149

150

151

152

153

154

155

156

157

158

159

160

161

162

163

//=======================================================================

// Authors: Andrew Lumsdaine, Lie-Quan Lee, Jeremy G. Siek

// Distributed under the Boost Software License, Version 1.0. (See

// accompanying file LICENSE_1_0.txt or copy at

// http://www.boost.org/LICENSE_1_0.txt)

//=======================================================================

// Sample output:

// 0 --(8, 10)--> 1

// 1 --(12, 20)--> 4 --(12, 40)--> 3

// <--(8,10)-- 0 <--(16,20)-- 2

// 2 --(16, 20)--> 1

// <--(16,20)-- 5

// 3 --(12, 40)--> 6

// <--(12,40)-- 1

// 4 --(12, 20)--> 7

// <--(12,20)-- 1

// 5 --(16, 20)--> 2

// <--(16,20)-- 6

// 6 --(16, 20)--> 5 --(8, 10)--> 8

// <--(12,20)-- 7 <--(12,40)-- 3

// 7 --(12, 20)--> 6

// <--(12,20)-- 4

// 8

// <--(8,10)-- 6

// 0 --(8, 1)--> 1

// 1 --(12, 2)--> 4 --(12, 3)--> 3

// <--(8,1)-- 0 <--(16,4)-- 2

// 2 --(16, 4)--> 1

// <--(16,7)-- 5

// 3 --(12, 5)--> 6

// <--(12,3)-- 1

// 4 --(12, 6)--> 7

// <--(12,2)-- 1

// 5 --(16, 7)--> 2

// <--(16,8)-- 6

// 6 --(16, 8)--> 5

// <--(12,10)-- 7 <--(12,5)-- 3

// 7 --(12, 10)--> 6

// <--(12,6)-- 4

// 8

#include <boost/config.hpp>

#include <iostream>

#include <boost/utility.hpp>

#include <boost/property_map/property_map.hpp>

#include <boost/graph/adjacency_list.hpp>

using namespace boost;

using namespace std;

enum edge_myflow_t

{

edge_myflow

};

enum edge_mycapacity_t

{

edge_mycapacity

};

namespace boost

{

BOOST_INSTALL_PROPERTY(edge, myflow);

BOOST_INSTALL_PROPERTY(edge, mycapacity);

}

template < class Graph > void print_network(const Graph& G)

{

using Viter = typename boost::graph_traits< Graph >::vertex_iterator;

using OutEdgeIter =

typename boost::graph_traits< Graph >::out_edge_iterator;

using InEdgeIter = typename boost::graph_traits< Graph >::in_edge_iterator;

auto capacity = get(edge_mycapacity, G);

auto flow = get(edge_myflow, G);

Viter ui, uiend;

boost::tie(ui, uiend) = vertices(G);

for (; ui != uiend; ++ui)

{

OutEdgeIter out, out_end;

cout << *ui << "\t";

boost::tie(out, out_end) = out_edges(*ui, G);

for (; out != out_end; ++out)

cout << "--(" << capacity[*out] << ", " << flow[*out] << ")--> "

<< target(*out, G) << "\t";

InEdgeIter in, in_end;

cout << endl << "\t";

boost::tie(in, in_end) = in_edges(*ui, G);

for (; in != in_end; ++in)

cout << "<--(" << capacity[*in] << "," << flow[*in] << ")-- "

<< source(*in, G) << "\t";

cout << endl;

}

int main(int, char*[])

{

using Cap = property< edge_mycapacity_t, int >;

using Flow = property< edge_myflow_t, int, Cap >;

using Graph

= adjacency_list< vecS, vecS, bidirectionalS, no_property, Flow >;

const int num_vertices = 9;

Graph G(num_vertices);

/* 2<----5

/ ^

/ \

V \

0 ---->1---->3----->6--->8

\ ^

\ /

V /

4----->7

add_edge(0, 1, Flow(10, Cap(8)), G);

add_edge(1, 4, Flow(20, Cap(12)), G);

add_edge(4, 7, Flow(20, Cap(12)), G);

add_edge(7, 6, Flow(20, Cap(12)), G);

add_edge(1, 3, Flow(40, Cap(12)), G);

add_edge(3, 6, Flow(40, Cap(12)), G);

add_edge(6, 5, Flow(20, Cap(16)), G);

add_edge(5, 2, Flow(20, Cap(16)), G);

add_edge(2, 1, Flow(20, Cap(16)), G);

add_edge(6, 8, Flow(10, Cap(8)), G);

print_network(G);

property_map< Graph, edge_myflow_t >::type flow = get(edge_myflow, G);

boost::graph_traits< Graph >::vertex_iterator v, v_end;

boost::graph_traits< Graph >::out_edge_iterator e, e_end;

int f = 0;

for (boost::tie(v, v_end) = vertices(G); v != v_end; ++v)

for (boost::tie(e, e_end) = out_edges(*v, G); e != e_end; ++e)

flow[*e] = ++f;

cout << endl << endl;

remove_edge(6, 8, G);

print_network(G);

return 0;

}