// graph-tool -- a general graph modification and manipulation thingy // // Copyright (C) 2007-2012 Tiago de Paula Peixoto // // 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 3 // of the License, or (at your option) any later version. // // 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. // // You should have received a copy of the GNU General Public License // along with this program. If not, see . #include "graph_filtering.hh" #include #include "graph.hh" #include "graph_selectors.hh" #include "graph_eigenvector.hh" using namespace std; using namespace boost; using namespace graph_tool; long double eigenvector(GraphInterface& g, boost::any w, boost::any c, double epsilon, size_t max_iter) { if (!w.empty() && !belongs()(w)) throw ValueException("edge property must be writable"); if (!belongs()(c)) throw ValueException("vertex property must be of floating point" " value type"); typedef ConstantPropertyMap weight_map_t; typedef mpl::push_back::type weight_props_t; if(w.empty()) w = weight_map_t(1); long double eig = 0; run_action<>() (g, bind (get_eigenvector(), _1, g.GetVertexIndex(), g.GetEdgeIndex(), _2, _3, epsilon, max_iter, ref(eig)), weight_props_t(), vertex_floating_properties())(w, c); return eig; } void export_eigenvector() { using namespace boost::python; def("get_eigenvector", &eigenvector); }