Boost logo

Boost :

From: Jeremy Siek (jsiek_at_[hidden])
Date: 2001-03-24 12:09:08

Hi Artur,

Let me guess, is it all the stuff about the property_map traits class (and
the mess of classes like vertex_property_selector, etc in
detail/adjacency_list.hpp) that is confusing you? It sure confuses me ;)

The main reason the property_map traits stuff is so complicated is that
the BGL components use workarounds instead of partial specialization. If I
had used partial spec. in the implementation of adjacency_list, then the
property_map traits stuff would have been MUCH simpler. Does your
compiler support partial spec?

The second complicated part about the adjacency_list implementation
is that it supports attaching multiple arbitrary properties to
the graph. Do you want your graph class to also have this capability
or do you just need to provide access to a couple specific
internal properties?


P.S. The stanford_graph.hpp is another example of a PropertyGraph
and is less complicated than adjacency_list.

On Sat, 24 Mar 2001 artwisz_at_[hidden] wrote:

artwis> Hello,
artwis> is there a step by step explanation or example of how to implement
artwis> the PropertyGraph concept ? I want to implement my own graph
artwis> representation. Studying the adjacency_list implementation is a
artwis> daunting task for me so far and still didn't figure everything out.
artwis> Just a plain PropertyGraph implementation example (as simple as
artwis> possible) would make my day.
artwis> Thanks for any reply.
artwis> Artur
artwis> To unsubscribe, send email to: <mailto:boost-unsubscribe_at_[hidden]>
artwis> Your use of Yahoo! Groups is subject to

 Jeremy Siek www:
 Ph.D. Candidate email: jsiek_at_[hidden]
 Univ. of Notre Dame work phone: (219) 631-3906

Boost list run by bdawes at, gregod at, cpdaniel at, john at