I suggest to simplify the graph by filtering out less important nodes/edges or aggregating data. Other alternative tools are Python or Gephi you may look into.

I think the Python package "NetworkX" should be able to handle it.

You can simplify the network by extracting only the largest component, removing nodes with low centrality, or filtering out links with low weights. Alternatively, you can use algorithms such as PFnet to retain only the most essential or structurally significant paths.