From cca66b9ec4e494c1d919bff0f71a820d8afab1fa Mon Sep 17 00:00:00 2001 From: Daniel Baumann Date: Sun, 7 Apr 2024 20:24:48 +0200 Subject: Adding upstream version 1.2.2. Signed-off-by: Daniel Baumann --- .../libcola/tests/max_acyclic_subgraph.cpp | 346 +++++++++++++++++++++ 1 file changed, 346 insertions(+) create mode 100644 src/3rdparty/adaptagrams/libcola/tests/max_acyclic_subgraph.cpp (limited to 'src/3rdparty/adaptagrams/libcola/tests/max_acyclic_subgraph.cpp') diff --git a/src/3rdparty/adaptagrams/libcola/tests/max_acyclic_subgraph.cpp b/src/3rdparty/adaptagrams/libcola/tests/max_acyclic_subgraph.cpp new file mode 100644 index 0000000..cb2eb38 --- /dev/null +++ b/src/3rdparty/adaptagrams/libcola/tests/max_acyclic_subgraph.cpp @@ -0,0 +1,346 @@ +/* + * vim: ts=4 sw=4 et tw=0 wm=0 + * + * libcola - A library providing force-directed network layout using the + * stress-majorization method subject to separation constraints. + * + * Copyright (C) 2006-2008 Monash University + * + * This library is free software; you can redistribute it and/or + * modify it under the terms of the GNU Lesser General Public + * License as published by the Free Software Foundation; either + * version 2.1 of the License, or (at your option) any later version. + * + * This library 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 + * Lesser General Public License for more details. + * + * You should have received a copy of the GNU Lesser General Public + * License along with this library in the file LICENSE; if not, + * write to the Free Software Foundation, Inc., 59 Temple Place, + * Suite 330, Boston, MA 02111-1307 USA + * +*/ + +#include +#include +#include +#include +#include +#include "graphlayouttest.h" + +using namespace std; +using namespace cola; +using vpsc::Rectangle; + +int main() { + MaxAcyclicSubgraph *mas; + Edges case_a, case_b, case_c, case_d, case_e, case_f; + Edges *subgraph = nullptr; + + vector rs; + unsigned V; + + // create case A + // case A consists of a basic graph where the start point is a source + cout << endl << "ENTERING CASE A" << endl; + V = 5; + case_a.push_back(Edge(0, 1)); + case_a.push_back(Edge(1, 2)); + case_a.push_back(Edge(2, 3)); + case_a.push_back(Edge(3, 4)); + case_a.push_back(Edge(4, 1)); + + // detect the subgraph + mas = new MaxAcyclicSubgraph(V, &case_a); + subgraph = mas->find_subgraph(); + + if (subgraph != nullptr) { + cout << "subgraph->size(): " << subgraph->size() << endl; + cout << "Ea: "; + for (unsigned i = 0; i < subgraph->size(); i++) { + // print out the subgraph + cout << "(" << (*subgraph)[i].first << ", " << (*subgraph)[i].second << ") "; + } + + cout << endl; + + // output a picture + rs.push_back(new Rectangle(10,10+5,10,10+5)); + rs.push_back(new Rectangle(30,30+5,30,30+5)); + rs.push_back(new Rectangle(30,30+5,60,60+5)); + rs.push_back(new Rectangle(65,65+5,60,60+5)); + rs.push_back(new Rectangle(65,65+5,30,30+5)); + + assert(rs.size() == V); + + output_svg(rs, case_a, "mas_case_a.svg", false, true, subgraph); + for (unsigned i = 0; i < rs.size(); i++) { delete rs[i]; } + rs.clear(); + + delete subgraph; + } + else { + cout << "No subgraph found" << endl; + } + + // create case B + // case B is the same graph of case A but with more elements + cout << endl << "ENTERING CASE B" << endl; + V = 7; + case_b.push_back(Edge(0, 1)); + case_b.push_back(Edge(1, 2)); + case_b.push_back(Edge(2, 3)); + case_b.push_back(Edge(3, 4)); + case_b.push_back(Edge(4, 1)); + case_b.push_back(Edge(5, 2)); + case_b.push_back(Edge(6, 5)); + + // detect the subgraph + mas->mod_graph(V, &case_b); + subgraph = mas->find_subgraph(); + + if (subgraph != nullptr) { + cout << "subgraph->size(): " << subgraph->size() << endl; + cout << "Ea: "; + for (unsigned i = 0; i < subgraph->size(); i++) { + // print out the subgraph + cout << "(" << (*subgraph)[i].first << ", " << (*subgraph)[i].second << ") "; + } + + cout << endl; + + // output a picture + rs.push_back(new Rectangle(10,10+5,10,10+5)); + rs.push_back(new Rectangle(30,30+5,30,30+5)); + rs.push_back(new Rectangle(30,30+5,60,60+5)); + rs.push_back(new Rectangle(65,65+5,60,60+5)); + rs.push_back(new Rectangle(65,65+5,30,30+5)); + rs.push_back(new Rectangle(30,30+5,90,90+5)); + rs.push_back(new Rectangle(65,65+5,90,90+5)); + + assert(rs.size() == V); + + output_svg(rs, case_b, "mas_case_b.svg", false, true, subgraph); + for (unsigned i = 0; i < rs.size(); i++) { delete rs[i]; } + rs.clear(); + + delete subgraph; + } + else { + cout << "No subgraph found" << endl; + } + + // create case C + // case C is a more complicated graph with nested subgraph + cout << endl << "ENTERING CASE C" << endl; + V = 14; + case_c.push_back(Edge(0, 1)); + case_c.push_back(Edge(0, 5)); + case_c.push_back(Edge(0, 6)); + case_c.push_back(Edge(2, 0)); + case_c.push_back(Edge(3, 5)); + case_c.push_back(Edge(4, 3)); + case_c.push_back(Edge(5, 4)); + case_c.push_back(Edge(5, 13)); + case_c.push_back(Edge(6, 2)); + case_c.push_back(Edge(6, 9)); + case_c.push_back(Edge(7, 6)); + case_c.push_back(Edge(8, 7)); + case_c.push_back(Edge(9, 10)); + case_c.push_back(Edge(9, 11)); + case_c.push_back(Edge(9, 12)); + case_c.push_back(Edge(10, 6)); + case_c.push_back(Edge(12, 10)); + case_c.push_back(Edge(13, 4)); + + // detect the subgraph + mas->mod_graph(V, &case_c); + subgraph = mas->find_subgraph(); + + if (subgraph != nullptr) { + cout << "subgraph->size(): " << subgraph->size() << endl; + cout << "Ea: "; + for (unsigned i = 0; i < subgraph->size(); i++) { + // print out the subgraph + cout << "(" << (*subgraph)[i].first << ", " << (*subgraph)[i].second << ") "; + } + + cout << endl; + + // output a picture + rs.push_back(new Rectangle(10,10+5,10,10+5)); // node 0 + rs.push_back(new Rectangle(20,20+5,40,40+5)); // node 1 + rs.push_back(new Rectangle(40,40+5,30,30+5)); // node 2 + rs.push_back(new Rectangle(30,30+5,60,60+5)); // node 3 + rs.push_back(new Rectangle(60,60+5,60,60+5)); // node 4 + rs.push_back(new Rectangle(10,10+5,90,90+5)); // node 5 + rs.push_back(new Rectangle(80,80+5,15,15+5)); // node 6 + rs.push_back(new Rectangle(110,110+5,15,15+5)); // node 7 + rs.push_back(new Rectangle(140,140+5,15,15+5)); // node 8 + rs.push_back(new Rectangle(110,110+5,60,60+5)); // node 9 + rs.push_back(new Rectangle(100,100+5,85,85+5)); // node 10 + rs.push_back(new Rectangle(140,140+5,50,50+5)); // node 11 + rs.push_back(new Rectangle(140,140+5,70,70+5)); // node 12 + rs.push_back(new Rectangle(45,45+5,90,90+5)); // node 13 + + assert(rs.size() == V); + + output_svg(rs, case_c, "mas_case_c.svg", false, true, subgraph); + for(int i = 0; i < V; i++) { delete rs[i]; } + rs.clear(); + delete subgraph; + } + else { + cout << "No subgraph found" << endl; + } + + // create case D + // case D consists of the same graph as case A but with a different starting location + cout << endl << "ENTERING CASE D" << endl; + V = 5; + case_d.push_back(Edge(0, 1)); + case_d.push_back(Edge(1, 2)); + case_d.push_back(Edge(2, 3)); + case_d.push_back(Edge(3, 0)); + case_d.push_back(Edge(4, 1)); + + // detect the subgraph + mas->mod_graph(V, &case_d); + subgraph = mas->find_subgraph(); + + if (subgraph != nullptr) { + cout << "subgraph->size(): " << subgraph->size() << endl; + cout << "Ea: "; + for (unsigned i = 0; i < subgraph->size(); i++) { + // print out the subgraph + cout << "(" << (*subgraph)[i].first << ", " << (*subgraph)[i].second << ") "; + } + + cout << endl; + + // output a picture + rs.push_back(new Rectangle(65,65+5,60,60+5)); + rs.push_back(new Rectangle(65,65+5,30,30+5)); + rs.push_back(new Rectangle(30,30+5,30,30+5)); + rs.push_back(new Rectangle(30,30+5,60,60+5)); + rs.push_back(new Rectangle(10,10+5,10,10+5)); + + assert(rs.size() == V); + + output_svg(rs, case_d, "mas_case_d.svg", false, true, subgraph); + for (unsigned i = 0; i < rs.size(); i++) { delete rs[i]; } + rs.clear(); + delete subgraph; + } + else { + cout << "No subgraph found" << endl; + } + + // create case E + // case E is a reordering of case C + cout << endl << "ENTERING CASE E" << endl; + V = 14; + case_e.push_back(Edge(0, 6)); + case_e.push_back(Edge(0, 9)); + case_e.push_back(Edge(1, 4)); + case_e.push_back(Edge(3, 10)); + case_e.push_back(Edge(4, 3)); + case_e.push_back(Edge(5, 0)); + case_e.push_back(Edge(6, 7)); + case_e.push_back(Edge(7, 0)); + case_e.push_back(Edge(7, 2)); + case_e.push_back(Edge(7, 10)); + case_e.push_back(Edge(8, 5)); + case_e.push_back(Edge(9, 12)); + case_e.push_back(Edge(9, 11)); + case_e.push_back(Edge(9, 13)); + case_e.push_back(Edge(10, 1)); + case_e.push_back(Edge(10, 4)); + case_e.push_back(Edge(12, 0)); + case_e.push_back(Edge(11, 12)); + + // detect the subgraph + mas->mod_graph(V, &case_e); + subgraph = mas->find_subgraph(); + if (subgraph != nullptr) { + cout << "subgraph->size(): " << subgraph->size() << endl; + cout << "Ea: "; + for (unsigned i = 0; i < subgraph->size(); i++) { + // print out the subgraph + cout << "(" << (*subgraph)[i].first << ", " << (*subgraph)[i].second << ") "; + } + + cout << endl; + + // output a picture + rs.push_back(new Rectangle(80,80+5,15,15+5)); // node 6 + rs.push_back(new Rectangle(45,45+5,90,90+5)); // node 13 + rs.push_back(new Rectangle(20,20+5,40,40+5)); // node 1 + rs.push_back(new Rectangle(30,30+5,60,60+5)); // node 3 + rs.push_back(new Rectangle(60,60+5,60,60+5)); // node 4 + rs.push_back(new Rectangle(110,110+5,15,15+5)); // node 7 + rs.push_back(new Rectangle(40,40+5,30,30+5)); // node 2 + rs.push_back(new Rectangle(10,10+5,10,10+5)); // node 0 + rs.push_back(new Rectangle(140,140+5,15,15+5)); // node 8 + rs.push_back(new Rectangle(110,110+5,60,60+5)); // node 9 + rs.push_back(new Rectangle(10,10+5,90,90+5)); // node 5 + rs.push_back(new Rectangle(140,140+5,70,70+5)); // node 12 + rs.push_back(new Rectangle(100,100+5,85,85+5)); // node 10 + rs.push_back(new Rectangle(140,140+5,50,50+5)); // node 11 + + assert(rs.size() == V); + + output_svg(rs, case_e, "mas_case_e.svg", false, true, subgraph); + for(int i = 0; i < V; i++) { delete rs[i]; } + rs.clear(); + delete subgraph; + } + else { + cout << "No subgraph found" << endl; + } + + // create case F + // case F consists of the same graph with sinks + cout << endl << "ENTERING CASE F" << endl; + V = 3; + case_f.push_back(Edge(0, 1)); + case_f.push_back(Edge(0, 2)); + case_f.push_back(Edge(1, 2)); + + // detect the subgraph + mas->mod_graph(V, &case_f); + subgraph = mas->find_subgraph(); + + if (subgraph != nullptr) { + cout << "subgraph->size(): " << subgraph->size() << endl; + cout << "Ea: "; + for (unsigned i = 0; i < subgraph->size(); i++) { + // print out the subgraph + cout << "(" << (*subgraph)[i].first << ", " << (*subgraph)[i].second << ") "; + } + + cout << endl; + + // output a picture + rs.push_back(new Rectangle(10,10+5,10,10+5)); + rs.push_back(new Rectangle(40,40+5,30,30+5)); + rs.push_back(new Rectangle(15,15+5,60,60+5)); + + assert(rs.size() == V); + + output_svg(rs, case_f, "mas_case_f.svg", false, true, subgraph); + for (unsigned i = 0; i < rs.size(); i++) { delete rs[i]; } + rs.clear(); + delete subgraph; + } + else { + cout << "No subgraph found" << endl; + } + + // END TEST + delete mas; + + return 0; +} -- cgit v1.2.3