forked from jeffythedragonslayer/lipton-tarjan
-
Notifications
You must be signed in to change notification settings - Fork 1
/
old.cpp
94 lines (79 loc) · 2.76 KB
/
old.cpp
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
93
94
#include "lipton-tarjan.h"
#include <iostream>
#include <fstream>
#include <csignal>
#include <boost/graph/adjacency_list.hpp>
#include <boost/graph/properties.hpp>
#include <boost/graph/graph_traits.hpp>
#include <boost/property_map/property_map.hpp>
#include <boost/graph/planar_canonical_ordering.hpp>
#include <boost/graph/is_straight_line_drawing.hpp>
#include <boost/graph/chrobak_payne_drawing.hpp>
#include <boost/graph/boyer_myrvold_planar_test.hpp>
#include <boost/lexical_cast.hpp>
#include <boost/algorithm/string.hpp>
#include <boost/graph/graphviz.hpp>
using namespace std;
using namespace boost;
Graph load_graph()
{
ifstream in("graph_in");
if( !in ){
cerr << "file \"in\" not found!\n";
exit(0);
}
string str;
Graph g;
while( getline(in, str) ){
uint colon = str.find(",");
string stra = str.substr(0, colon); trim(stra);
string strb = str.substr(colon+1 ); trim(strb);
uint a = lexical_cast<uint>(stra);
uint b = lexical_cast<uint>(strb);
add_edge(a, b, g);
}
return g;
}
struct Coord
{
size_t x, y;
};
typedef vector<Coord> StraightLineDrawingStorage;
Graph* gg;
struct pos_writer
{
template <class VertexOrEdge>
void operator() (ostream& out, const VertexOrEdge& v) const
{
Graph& g = *gg;
int x = g[v].x;
int y = g[v].y;
out << "[pos=\"" << lexical_cast<int>(x) << ',' << lexical_cast<int>(y) << "!\"]";
}
};
void save_graph(Graph g, Embedding* embedding, vector<VertexDescriptor> ordering)
{
typedef iterator_property_map<StraightLineDrawingStorage::iterator, property_map<Graph, vertex_index_t>::type> StraightLineDrawing;
StraightLineDrawingStorage straight_line_drawing_storage(num_vertices(g));
StraightLineDrawing straight_line_drawing (straight_line_drawing_storage.begin(), get(vertex_index,g));
chrobak_payne_straight_line_drawing(g, *embedding, ordering.begin(), ordering.end(), straight_line_drawing);
ofstream f2("out_graph.txt");
graph_traits<Graph>::vertex_iterator vi, vi_end;
int i = 0;
for( tie(vi, vi_end) = vertices(g); vi != vi_end; ++vi ){
Coord coord(get(straight_line_drawing,*vi));
f2 << coord.x << ", " << coord.y << '\n';
g[i].x = coord.x;
g[i].y = coord.y;
i++;
}
gg = &g;
ofstream f("out_graph.dot");
write_graphviz(f, g, pos_writer());
}
int main()
{
auto g = load_graph();
auto p = lipton_tarjan(g);
save_graph(g, p.embedding, p.ordering);
}