[Lemon-user] Question about using dijkstra's algorithm

[Yongjia Song]

Hi all,

I am a new user of lemon, and I could not figure out a way to use dijkstra's
algorithm appropriately.

Is there any example file for that? I can see that the documentation part of
dijkstra's algorithm on the website could not work.

Basically, I use

SmartDigraph g;
SmartDigraph::ArcMap<int> cap(g)
Dijkstra<SmartDigraph> dijkstra(g,cap)

then I could not run either

 dijkstra <http://lemon.cs.elte.hu/pub/doc/1.1.1/a00437.html#ga6aa57523fe00e2b8fe2f5cd17dd15cea>(g,
cap).distMap(dist).run(s,t);

or

dijkstra <http://lemon.cs.elte.hu/pub/doc/1.1.1/a00437.html#ga6aa57523fe00e2b8fe2f5cd17dd15cea>.distMap(dist);
dijsktra.init();
dijkstra <http://lemon.cs.elte.hu/pub/doc/1.1.1/a00437.html#ga6aa57523fe00e2b8fe2f5cd17dd15cea>.addSource(s);
dijkstra <http://lemon.cs.elte.hu/pub/doc/1.1.1/a00437.html#ga6aa57523fe00e2b8fe2f5cd17dd15cea>.start();

Thanks,


-- 
Sincerely:
Song Yongjia（宋永佳）

Department of Industrial and Systems Engineering
College of Engineering, University of Wisconsin-Madison
3241 Mechanical Engineering Building
1513 University Avenue, Madison, WI 53706
-------------- next part --------------
An HTML attachment was scrubbed...
URL: <http://lemon.cs.elte.hu/pipermail/lemon-user/attachments/20110104/57f2fdc7/attachment.html>