Re: [Boost-users] graph all pair shortest path problem

Subject: Re: [Boost-users] graph all pair shortest path problem
From: Steven Watanabe (watanabesj_at_[hidden])
Date: 2008-09-05 11:39:00

AMDG

Nicolas Heine wrote:
> I have a question about the All Pair Shortest Path (Johnson) algorithm.
>
> Here is my code:
>
> <snip>
>
> When I compile  I get the error:
> ../src/BGLTest.cpp: In function 'int main()':
> ../src/BGLTest.cpp:73: error: no matching function for call to 
> 'johnson_all_pairs_shortest_paths(main()::Graph&, int [(((long 
> unsigned int)(((int)N) - 1)) + 1u)][(((long unsigned int)(((int)N) - 
> 1)) + 1u)], boost::bgl_named_params<int*, boost::vertex_distance_t, 
> boost::no_property>)'
>
> What does that mean? I want to use the Johnson algorithm with a listS 
> = Vertexlist and listS = Egelist.   With listS, vecS as in your 
> example it works fine. What can I do?

Your code compiles for me after I changed the definition of N to
static const int N = 10;

In Christ,
Steven Watanabe