[erlang-questions] Erlang Travelling Salesman or floyd-warshall example.

[ggaliens@REDACTED]

Looking for an Erlang Travelling Salesman or floyd-warshall example.

To take a graph of path weights between nodes and prune it down to shortest path. I found one example on net ... but after cut/paste ... it just seems to be the identify function for its matrix inputs. 

Seems like something I'll debug/implement if I don't find a canned example soon.