From: Eric Fowler (efowler_at_[hidden])
Date: 2003-04-15 23:18:29
Sorry if this is obvious, I am just getting started with BGL.
I wish to make a simple geometric graph, in which vertices are comprised of
points in x, y space(x, y being unsigned integers), and edge weights are
unsigned integers equal to the distance-squared between the vertex points.
Here's where I am at:
using namespace boost;
typedef std::pair<unsigned, unsigned> Point;
int main(int argc, char* argv)
typedef adjacency_list<listS, vecS, directedS> Graph;
Point p(1, 2); //just to show it all compiles
Now, how do I "tell" my Graph I am storing Point vertices with unsigned int
edges? Do I need to define properties? How?
Boost list run by bdawes at acm.org, gregod at cs.rpi.edu, cpdaniel at pacbell.net, john at johnmaddock.co.uk