Hello .

I tried modeling network topology as a graph using Neo4j. To show its effectiveness, I used large scale typologies ranging from 10875, 26518, 36682 to 62586 nodes.

I run the shortest path algorithm to find the shortest path between two nodes (source and target). I want to benefit from other algorithms in the GDS library. any suggestions?

What about centrality algorithms like Betweenness, Closeness, etc. can it be useful if applied in the domain of networking?