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
|
/* Copyright (c) 1997-2015
Ewgenij Gawrilow, Michael Joswig (Technische Universitaet Berlin, Germany)
http://www.polymake.org
This program is free software; you can redistribute it and/or modify it
under the terms of the GNU General Public License as published by the
Free Software Foundation; either version 2, or (at your option) any
later version: http://www.gnu.org/licenses/gpl.txt.
This program is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
GNU General Public License for more details.
--------------------------------------------------------------------------------
*/
#ifndef POLYMAKE_GRAPH_LINE_GRAPH_H
#define POLYMAKE_GRAPH_LINE_GRAPH_H
#include "polymake/Graph.h"
namespace polymake { namespace graph {
namespace {
template <typename in_edge_iterator, typename out_edge_iterator> inline
bool stop_at(const in_edge_iterator&, const out_edge_iterator& out_edge_it, Directed)
{
return out_edge_it.at_end();
}
template <typename edge_iterator> inline
bool stop_at(const edge_iterator& edge1_it, const edge_iterator& edge2_it, Undirected)
{
return edge1_it == edge2_it;
}
}
template <typename Kind>
Graph<typename Kind::non_multi_type> line_graph(const Graph<Kind>& G)
{
G.enumerate_edges();
Graph<typename Kind::non_multi_type> result(G.edges());
for (typename Nodes< Graph<Kind> >::const_iterator node_it = nodes(G).begin();
!node_it.at_end(); ++node_it) {
for (typename Graph<Kind>::in_edge_list::const_iterator in_edge_it = G.in_edges(*node_it).begin();
!in_edge_it.at_end(); ++in_edge_it) {
for (typename Graph<Kind>::out_edge_list::const_iterator out_edge_it = G.out_edges(*node_it).begin();
!stop_at(in_edge_it, out_edge_it, typename Kind::non_multi_type());
++out_edge_it) {
result.edge(*in_edge_it, *out_edge_it);
}
}
}
return result;
}
} }
#endif // POLYMAKE_GRAPH_LINE_GRAPH_H
// Local Variables:
// mode:C++
// c-basic-offset:3
// indent-tabs-mode:nil
// End:
|
