Add a shortest path algorithm

[acombretrenouard]

We could add an algorithm that computes shortest paths between nodes.
The notion of path is not unique, but a starting point could be : "An ordered list of nodes where two consecutive nodes belong to at least one hyperedge. All nodes are distincts."

I wrote such a feature, based on method all_shortest_paths from networkx.

I can work on adding it to the basecode !

[lordgrilo]

This seems an interesting addition too.
Since this is based on nodes, maybe it could be called something like node-centric-shortest-path (as opposed to walks defined on hyperedges sharing at least a certain number of nodes, which could be 1 in the extremal case)

[maximelucas]

Thanks Antoine! Yes, very happy to see PRs with all the additions you're suggesting in the issues you raised.

[nwlandry]

Great idea, Antoine - this would be awesome to add to XGI!

[nwlandry]

Fixed by #368.