Re: Floyd warshall

andrea escreveu:

I need to find shortest paths from from every nodes to every nodes of
a graph.

Since this questions is suspiciously similar to someone asking for a homework:

I think Floyd warshall could be alright but I've got no idea of how
could be the implementation in prolog...

Do you know it works so you recognize how to describe it?

Do you know enough Prolog so you can represent the graph in Prolog terms?

Any idea?? Google didn't helped unfortunately...

If you can do what I ask above, you could build a set of predicates to perform the algorithm.

Any other ways to solve this problem?

Yes, a lot. What is exactly your purpose?
.