Hi guys

I'm trying to solve the all-path shortest path problem using Floyd-Warshall Algorithm, for more information please visit the following links, you can also the Algorithm working on these websites

http://www.cs.toronto.edu/~heap/270F02/node42.html
http://www-unix.mcs.anl.gov/dbpp/text/node35.html

Now doing it in the conventional programming language like C++, Java or C# that wont be much of a problem

But I’m new to XSTL 2.0 and trying to figure out how can I implement this in XSTL
do you guys have any idea?

If you guys can help that will be great and much appreciated


Thank you
Bye

You need help on this from someone who's good at functional programming; I would expect any solution to take advantage of Dimitre Novatchev's FXSL library. I haven't got the time to tackle this one for you, but you might find someone on the xsl-list at mulberrytech.com is prepared to give it a go. It might be that for a functional programming language you need a completely different approach - that often seems to the the way with graph algorithms.

Michael Kay
http://www.saxonica.com/
Author, XSLT Programmer's Reference and XPath 2.0 Programmer's Reference