[graph-tool] Using Inline for Search/Traversal
parvisp at gmail.com
Thu Aug 25 22:12:05 CEST 2011
Is it possible to write the code for graph traversal in C++ rather than using
the Python wrappers? I need the graph search to be as fast as possible.
I tried something simple like this: http://pastebin.com/m2pwFQKy
It looks like the typedefs for 'graph_graph_t' don't appear until after the
support code: http://pastebin.com/itT73DxT
Is there an example of how to achieve something similar?
Thanks Tiago Peixoto for developing/maintaining this great library!
View this message in context: http://main-discussion-list-for-the-graph-tool-project.982480.n3.nabble.com/Using-Inline-for-Search-Traversal-tp3284947p3284947.html
Sent from the Main discussion list for the graph-tool project mailing list archive at Nabble.com.
More information about the graph-tool