johnson_all_pairs_shortest_paths under MSVC 6.0?

Hi, Does anybody has experience in applying johnson_all_pairs_shortest_paths under WINDOWS? Examples would help me a lot. I have difficulties in compiling the johnson_all_pairs_shortest_paths example in the library: example/johnson-eg.cpp The code D[id2[*u]-1][id2[*v]-1] = get(d, *v) + get(h, *v) - get(h, *u); has error: "subscript requires array or pointer type" Thanks a lot. Vivid

On Jun 28, 2005, at 5:05 PM, Vivid Yang wrote:
Hi,
Does anybody has experience in applying johnson_all_pairs_shortest_paths under WINDOWS? Examples would help me a lot.
I have difficulties in compiling the johnson_all_pairs_shortest_paths example in the library: example/johnson-eg.cpp
The code
D[id2[*u]-1][id2[*v]-1] = get(d, *v) + get(h, *v) - get(h, *u);
has error:
"subscript requires array or pointer type"
Which compiler are you using? Doug
participants (2)
-
Douglas Gregor
-
Vivid Yang