Re: [Boost-users] CSR graph and Dijkstra's to lower graph memory

Subject: Re: [Boost-users] CSR graph and Dijkstra's to lower graph memory
From: Jeremiah Willcock (jewillco_at_[hidden])
Date: 2012-09-22 14:51:49

On Sat, 22 Sep 2012, Leo Hidd wrote:

> hi Jeremy,
>
> I'm the OP of that topic. With a great help of Jeremiah WillCock (thank you 
> Jeremiah, you are a great and very patient man :) ), I could finally obtain 
> an working case with CSR graphs (a great amount of messages were sent in 
> private, so they do not appear in the list). Here's an example. Note that I 
> don't provide the the class obj_Mesh, since the only variables I use from it 
> are used to compute the number of edges and the cost of each edge. You can 
> replace these info by your own.

The one thing I would change about the example is not to use &d[0] and 
&p[0] but to use an iterator_property_map instead (see 
<URL:http://comments.gmane.org/gmane.comp.lib.boost.user/67769>); using 
raw pointers has caused problems for various users in the past.

-- Jeremiah Willcock