boost/graph
2
0
Fork 0
mirror of https://github.com/boostorg/graph.git synced 2026-02-26 04:42:16 +00:00
Code Issues Projects Releases Wiki Activity

Revert [67111] (addition of boost/detail/iomanip.hpp) and all the commits that depend on it. ([68137], [68140], [68141], [68154], and [68165]).

Browse Source 
[SVN r68168]
This commit is contained in:
Steven Watanabe
2011-01-15 08:11:51 +00:00
parent 074277924a
commit a4452c3539
12 changed files with 38 additions and 39 deletions
Download Patch File Download Diff File Expand all files Collapse all files

10
test/bellman-test.cpp
View File

@@ -14,7 +14,7 @@ B: 2147483647 B
*/
#include <iostream>
#include <boost/detail/iomanip.hpp>
#include <iomanip>
#include <boost/graph/adjacency_list.hpp>
#include <boost/graph/bellman_ford_shortest_paths.hpp>
#include <boost/cstdlib.hpp>
@@ -66,9 +66,9 @@ int test_main(int, char*[])
for(int i = 0; i < numVertex; ++i) {
std::cout << name[i] << ": ";
if (distance[i] == inf)
std::cout << boost::detail::setw(3) << "inf";
std::cout << std::setw(3) << "inf";
else
std::cout << boost::detail::setw(3) << distance[i];
std::cout << std::setw(3) << distance[i];
std::cout << " " << name[parent[i]] << std::endl;
}
} else {
@@ -87,9 +87,9 @@ int test_main(int, char*[])
for(int i = 0; i < numVertex; ++i) {
std::cout << name[i] << ": ";
if (distance2[i] == inf)
std::cout << boost::detail::setw(3) << "inf";
std::cout << std::setw(3) << "inf";
else
std::cout << boost::detail::setw(3) << distance2[i];
std::cout << std::setw(3) << distance2[i];
std::cout << " " << name[parent2[i]] << std::endl;
}
} else {

10
test/johnson-test.cpp
View File

@@ -26,7 +26,7 @@
#include <fstream>
#include <iostream>
#include <vector>
#include <boost/detail/iomanip.hpp>
#include <iomanip>
#include <boost/property_map/property_map.hpp>
#include <boost/graph/adjacency_list.hpp>
#include <boost/graph/graphviz.hpp>
@@ -63,14 +63,14 @@ int main()
int D[V][V];
johnson_all_pairs_shortest_paths(g, D, distance_map(&d[0]));
std::cout << boost::detail::setw(5) <<" ";
std::cout << std::setw(5) <<" ";
for (int k = 0; k < 10; ++k)
std::cout << boost::detail::setw(5) << k ;
std::cout << std::setw(5) << k ;
std::cout << std::endl;
for (int i = 0; i < 10; ++i) {
std::cout <<boost::detail::setw(5) << i ;
std::cout <<std::setw(5) << i ;
for (int j = 0; j < 10; ++j) {
std::cout << boost::detail::setw(5) << D[i][j] ;
std::cout << std::setw(5) << D[i][j] ;
}
std::cout << std::endl;
}