Subject: Re: [boost] [graph/adjacency_list] edge have many costs
From: aymen kaabi (kaabiayman_at_[hidden])
Date: 2014-04-10 08:42:39
i mean that i can use map for multiple weight because with bundled property
when i call the map i can not set the index i have to pass all the map
2014-04-10 6:51 GMT+01:00 Jeremiah Willcock <jewillco_at_[hidden]>:
> On Tue, Apr 8, 2014 6:59 AM PDT aymen kaabi wrote:
> >Good morning,
> >I want to create a graph that their egdes have array of cost ( i dont mean
> >bundle property) because i want to create this graph and try dijikstra for
> >every cost values .
> >can i have an example.
> >example: graph have 2 edge 1->2 ( cost 1,2,3,4,7)
> > 2->3(cost 2,5,3,8,9)
> >thanks for your helps
> Edges can have arbitrary properties, so you can create a graph whose edge
> weight property is a container type. What are you planning to use the
> multiple weights for? For some uses, parallel edges between the same
> vertices might make sense to consider as well.
> -- Jeremiah Willcock
> Unsubscribe & other changes:
Boost list run by bdawes at acm.org, gregod at cs.rpi.edu, cpdaniel at pacbell.net, john at johnmaddock.co.uk