/* Copyright (c) 1997-2004 Ewgenij Gawrilow, Michael Joswig (Technische Universitaet Berlin, Germany) http://www.math.tu-berlin.de/polymake, mailto:polymake@math.tu-berlin.de 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. */ #ident "$Project: polymake $$Id: connected_comp.cc 4714 2004-06-22 16:23:15Z gawrilow $" #include #include #include #include namespace polymake { namespace graph { void connected_comp (Poly& p, const char* graph_section, const char* result_section) { const Graph<> G=p.give(graph_section); p.take(result_section) << as_array(connected_components(G)); } } } using namespace polymake; /** @file connected_comp * * Computes the connected components. The connected components are * encoded by their node sets. * * @synopsis connected_comp * * @reading * @writing */ int main(int argc, const char *argv[]) { if (argc!=4) { cerr << "usage: " << argv[0] << " \n"; return 1; } try { Poly p(argv[1], ios::in | ios::out); graph::connected_comp(p, argv[2], argv[3]); } catch (const std::exception& e) { cerr << e.what() << endl; return 1; } return 0; }