Re: [Boost-users] [BGL] total newbie question

From: David Abrahams (dave_at_[hidden])
Date: 2006-06-23 22:47:58

<pixelpusher_at_[hidden]> writes:

> Anyway, what I was hoping to find was more of a tutorial in how to get
> started writing a path-finding program using BGL and (probably) the
> Dijkstra-shortest paths template.  - I have a set of edges that I will
> read from a text file. I don't know in advance how many edges will be
> read, so I plan to use an std::vector to store each edge's id, nodes,
> and weight. (All of the examples construct an array of known size and
> use that to build the graph. None use variable sized structures to
> build the graph.) Unless, of course, I can load the graph without
> pre-constructing a storage scheme.  - The edge weights have to be
> modified based on the user's preferences, which will change with every
> run. (None of the examples show how to change edge weights.)  - I will
> have known starting and ending nodes. I don't need to know the paths
> from my source to every possible destination. I only need to extract
> the best one that leads to my destination.
>
> I'd be happy enough for now just to know how to get started on the
> first bullet. Can anyone provide any guidance here? I'd really
> appreciate it.

Do you have the book?
http://www.awprofessional.com/bookstore/product.asp?isbn=0201729148&rl=1

-- 
Dave Abrahams
Boost Consulting
www.boost-consulting.com