basic subroutines: dfs, dijstra, etc

graph-tool
1

Hi all,

I'm hoping to use graph-tool for a project involving huge graphs, but
I can't seem to find simple routines like depth-first search and
Dijkstra's algorithm in the documentation. I noticed that these are
listed under milestone 2.2 -- are they not yet implemented? Apologies
if the answer lies in the documentation or this mailing list; I have
searched in vain for some time. I'd hate to turn to a much slower
library for want of these simple routines... graph-tool looks perfect
otherwise!

Rafael

2

Hi Rafael,

Hi all,

I'm hoping to use graph-tool for a project involving huge graphs, but
I can't seem to find simple routines like depth-first search and
Dijkstra's algorithm in the documentation. I noticed that these are
listed under milestone 2.2 -- are they not yet implemented? Apologies
if the answer lies in the documentation or this mailing list; I have
searched in vain for some time. I'd hate to turn to a much slower
library for want of these simple routines... graph-tool looks perfect
otherwise!

I have an implementation of DFS, BFS, Dijkstra, etc, almost ready for
release. It is just an wrapper around the Boost routines, and the only
thing missing is the documentation. You can expect this very soon in
graph-tool.

If you just want to find the shortest distance or paths, this is already
in the library.

Cheers,
Tiago

3

There is now a graph_tool.search module available in the git repository,
which contains DFS, BFS, Dijkstra, Bellman-Ford and A* search algorithms
from the boost graph library, complete with visitor interface.

Enjoy!

Cheers,
Tiago

4

There is now a graph_tool.search module available in the git repository,
which contains DFS, BFS, Dijkstra, Bellman-Ford and A* search algorithms
from the boost graph library, complete with visitor interface.

Thanks Tiago!!

Rafael