On 29 Nov 2006 11:35:52 -0800, Bytter <[EMAIL PROTECTED]> wrote:
> Ok, found the solution here: http://www.osl.iu.edu/~dgregor/bgl-python/
>
> But still cannot make anything that works... Anyone who has experience
> in this area can help me with the following code:
>
> import boost as bgl
>
> graph
Ok, found the solution here: http://www.osl.iu.edu/~dgregor/bgl-python/
But still cannot make anything that works... Anyone who has experience
in this area can help me with the following code:
import boost as bgl
graph = bgl.Graph()
a = graph.add_vertex()
b = graph.add_vertex()
e = graph.add_edg
Hi everyone,
I need to implement a very quick (performance-wise) Dijkstra shortest
path in python, and found that libboost already has such thing. Problem
is: I cannot find the installation package for my Python 2.4 under
windows. Can someone please provide me instructions for installing
libboost
