[igraph] Space complexity of Dijkstra's algorithm

[Vincent Labatut]

Hello,

the time complexity of Dijkstra's algorithm, as implemented in igraph, is indicated in the documentation of the C version:

http://igraph.org/c/doc/igraph-Structural.html#igraph_shortest_paths_dijkstra

I would like to know, in addition, what the space complexity of this implementation is.

And I have the same question for this other function:

http://igraph.org/c/doc/igraph-Structural.html#igraph_average_path_length

Thanks,

Vincent