Support for decorating edges and vertexes

[mkindahl]

In order to implement algorithms such as shortest-path and max-flow, it is necessary to be able to decorate edges and vertexes with weights or costs. This should ideally not be restricted to just a few values, but a generic API should be constructed.