I have 8400+ nodes in my graph, for which I want to get the smallest path for all the pairs of all the nodes. I tried to use the network, resulting in a memory error.
Traceback (most recent call final): File "C: \ user \ asif \ pythonworkspace \ formally \ src \ lastlast.py", line 19,
I have tried this mynewgraph = nx.all_pairs_shortest_path (myGraph) so far
All my nodes have string data types and it has an engagement in every edge.
Please provide your suggestions
No comments:
Post a Comment