Does anyone have an example of a distributed breadth-first-search algorithm in Erlang? If you had a large graph in ETS on 10 different machines and wanted to quickly find the path from one node on the graph to another. Thanks.