/* 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: diameter.cc 4714 2004-06-22 16:23:15Z gawrilow $"
#include <diameter.h>
#include <Poly.h>
#include <Graph.h>
namespace polymake { namespace graph {
void diameter(Poly& p, const char* graph_section, const char* result_section)
{
const Graph<> G=p.give(graph_section);
p.take(result_section) << diameter(G);
}
} }
using namespace polymake;
/** @file diameter
*
* Compute the diameter of an undirected graph.
*
* @synopsis diameter <file> <graph_section> <diameter_section>
*
* @reading <graph_section>
* @writing <diameter_section>
*/
int main(int argc, char *argv[]) {
if (argc!=4) {
cerr << "usage: " << argv[0] << " <file> <graph_section> <diameter_section>\n";
return 1;
}
try {
Poly p(argv[1], ios::in | ios::out);
graph::diameter(p, argv[2], argv[3]);
}
catch (const std::exception& e) {
cerr << e.what() << endl;
return 1;
}
return 0;
}
syntax highlighted by Code2HTML, v. 0.9.1