[erlang-questions] graph in erlang

[Eduardo Felipe Zambom Santana]

I am using the digraph module and it is efficient enough for my
requirements. I am creating a digraph with ~60k vertex and ~130k links of
the map of São Paulo and I can calculate the best path for ~100k
origin-destination pairs in less than 5 minutes.

I am also creating a distributed version of this graph, in which each
digraph node is a process, but I do not run any algorithm in this graph, it
is used just to processes that already known its best path move.

the distributed version of the graph occupies ~1,5 GB of memory and I am
using dictionaries to manage it.


2017-09-29 15:30 GMT-03:00 Karlo Kuna <kuna.prime@REDACTED>:

> how to efficiently represent and store graphs in erlang?
>
> obvious thing would be process per node ??
>
> _______________________________________________
> erlang-questions mailing list
> erlang-questions@REDACTED
> http://erlang.org/mailman/listinfo/erlang-questions
>
>
-------------- next part --------------
An HTML attachment was scrubbed...
URL: <http://erlang.org/pipermail/erlang-questions/attachments/20170929/ee9e2897/attachment.htm>