c++ - How to produce a symmetric layout for a large graph? -


i using boost's kamada-kawai spring layout algorithm implementation produce symmetric graph layouts. works small graphs (up few hundred of vertices). however, slow larger graphs.

i looked inside boost code find takes time , discovered algorithm begins computing all-pairs shortest paths, exhibits cubic complexity of course.

for application, graphs of interest consist of tens of thousands of vertices. graphs pretty sparse, number of edges small factor larger number of vertices.

is there trick or alternative can use obtain symmetric layouts such graphs?


Comments

Popular posts from this blog

asynchronous - C# WinSCP .NET assembly: How to upload multiple files asynchronously -

aws api gateway - SerializationException in posting new Records via Dynamodb Proxy Service in API -

asp.net - Problems sending emails from forum -