[erlang-questions] Erlang Travelling Salesman or floyd-warshall example.
Tue Feb 2 16:41:43 CET 2016
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.
More information about the erlang-questions