boost/graph
2
0
Fork 0
mirror of https://github.com/boostorg/graph.git synced 2026-01-28 07:12:14 +00:00
Code Issues Projects Releases Wiki Activity

doc/*: Document Python bindings

Browse Source 
src/python/basic_graph.cpp src/python/basic_graph.hpp:
  - Add ability to record the names of vertices input via the adjacency list
    reader.

example/python/breadth_first_search.py: Building a better example


[SVN r28350]
This commit is contained in:
Douglas Gregor
2005-04-20 23:45:55 +00:00
parent efc05efebd
commit 34bc3a8786
7 changed files with 622 additions and 53 deletions
Download Patch File Download Diff File Expand all files Collapse all files

17
src/python/basic_graph.cpp
View File

@@ -114,13 +114,17 @@ basic_graph<DirectedS>::basic_graph()
{ }
template<typename DirectedS>
basic_graph<DirectedS>::basic_graph(::boost::python::object l)
basic_graph<DirectedS>::basic_graph(boost::python::object l,
const std::string& name_map)
: inherited()
{
using boost::python::object;
std::map<object, vertex_descriptor> verts;
int len = ::boost::python::extract<int>(l.attr("__len__")());
vector_property_map<object, VertexIndexMap> name;
if (!name_map.empty()) name = get_vertex_map<object>(name_map);
for (int i = 0; i < len; ++i) {
vertex_descriptor u, v;
object up = l[i][0];
@@ -128,10 +132,16 @@ basic_graph<DirectedS>::basic_graph(::boost::python::object l)
typename std::map<object, vertex_descriptor>::iterator pos;
pos = verts.find(up);
if (pos == verts.end()) u = verts[up] = add_vertex();
if (pos == verts.end()) {
u = verts[up] = add_vertex();
if (!name_map.empty()) name[u] = up;
}
else u = pos->second;
pos = verts.find(vp);
if (pos == verts.end()) v = verts[vp] = add_vertex();
if (pos == verts.end()) {
v = verts[vp] = add_vertex();
if (!name_map.empty()) name[v] = vp;
}
else v = pos->second;
add_edge(u, v);
@@ -572,6 +582,7 @@ void export_basic_graph(const char* name)
class_<basic_graph<DirectedS> >(name)
// Constructors
.def(init<object>())
.def(init<object, std::string>())
.def(init<std::string, graph_file_kind>())
.def(init<erdos_renyi, std::size_t>(
(arg("generator"), arg("seed") = 1)))

3
src/python/basic_graph.hpp
View File

@@ -228,7 +228,8 @@ class basic_graph
adjacency_iterator;
basic_graph();
basic_graph(::boost::python::object);
basic_graph(boost::python::object,
const std::string& name_map = std::string());
basic_graph(const std::string& filename, graph_file_kind kind);
basic_graph(erdos_renyi, int seed);
basic_graph(power_law_out_degree, int seed);