graph library documentation issues ("Using adjacency_list")

[Hans Meine <hans_meine@…>]

I am currently studying the "Using adjacency_list" documentation page (libs/graph/doc/using_adjacency_list.html), and I found several issues:

Creating your own property types and properties is easy; just define a tag class for your new property. The property tag class will need to define num with a unique integer ID, and kind which should be either edge_property_tag, vertex_property_tag, or graph_property_tag.

struct flow_t {
  typedef edge_property_tag kind;
};

1. Where is num defined? (Is it necessary at all?)
2. (If necessary) where exactly does it need to be unique? (Within a certain namespace? Over all edge properties? Over all vertex+edge properties?
3. What about the range (number of bits?), reserved numbers/ranges and consecutiveness?

Access the propety acessor type for this graph

(Typo in "property")