Subject: Re: [boost] [graph/adjacency_list] edge have many costs
From: Jeremiah Willcock (jewillco_at_[hidden])
Date: 2014-04-10 01:51:23
On Tue, Apr 8, 2014 6:59 AM PDT aymen kaabi wrote:
>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
Boost list run by bdawes at acm.org, gregod at cs.rpi.edu, cpdaniel at pacbell.net, john at johnmaddock.co.uk