Re: [Boost-users] [BGL]: Highest performance graph-type available?

From: Dmitry Bufistov (dmitry_at_[hidden])
Date: 2006-05-11 10:53:28

Greg Link wrote:
> I'm using BGL for the johnson_all_pairs_shortest_path algorithm, 
>[snip]
> and I'm wondering if that's the best choice. My graph has (E=2*V),  
> and all nodes are of constant degree, with 4 edges incident on them.  

Hi Grek,
Probably there is better algorithm for your original problem). Could you 
describe in brief it?
Regards,
--dima