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

Lots of new algorithms and cleanups of old ones

Browse Source 
[SVN r27579]
This commit is contained in:
Douglas Gregor
2005-03-08 18:54:45 +00:00
parent 760b7f6c45
commit d3d9fdc0e5
28 changed files with 1423 additions and 193 deletions
Download Patch File Download Diff File Expand all files Collapse all files

10
src/python/dijkstra_shortest_paths.cpp
View File

@@ -10,15 +10,10 @@
#include "graph.hpp"
#include "digraph.hpp"
#include <boost/python.hpp>
#include "dijkstra_visitor.hpp"
namespace boost { namespace graph { namespace python {
#define BGL_PYTHON_VISITOR dijkstra_visitor
#define BGL_PYTHON_EVENTS_HEADER "dijkstra_events.hpp"
#include "visitor.hpp"
#undef BGL_PYTHON_EVENTS_HEADER
#undef BGL_PYTHON_VISITOR
template<typename Graph>
void
dijkstra_shortest_paths
@@ -69,7 +64,6 @@ dijkstra_shortest_paths
}
}
template<typename Graph>
void export_dijkstra_shortest_paths_in_graph()
{
@@ -80,7 +74,7 @@ void export_dijkstra_shortest_paths_in_graph()
void export_dijkstra_shortest_paths()
{
using boost::python::arg;
using boost::python::def;
def("dijkstra_shortest_paths", &dijkstra_shortest_paths<Graph>,
(arg("graph"), arg("root_vertex"),