Visualizing Undirected Graph That’s Too Large for GraphViz? [closed]

by

Graphviz itself provides a solution for rendering large graphs.

Namely, Graphviz includes sfdp, a multiscale version of fdp (also in graphviz, similar to neato) for the layout of large undirected graphs which has been useful for drawing large graphs (70k nodes, 500k edges) in my project.

You can find documentation for this software on the graphviz web site itself at http://www.graphviz.org/

For more information, here is Efficient and high quality force-directed graph drawing, a paper by Yifan Hu describing the underlying techniques and examples:
http://yifanhu.net/PUB/graph_draw_small.pdf

And a web archive version: https://web.archive.org/web/20210812011222/http://yifanhu.net/PUB/graph_draw.pdf

More Related Contents:

  1. How to force node position (x and y) in graphviz
  2. Planar Graph Layouts
  3. Graph theory puzzle about connectivity?
  4. Graph visualization library in JavaScript
  5. Definition of a path/trail/walk
  6. Best algorithm for detecting cycles in a directed graph [closed]
  7. Finding all cycles in a directed graph
  8. Graph Algorithm To Find All Connections Between Two Arbitrary Vertices
  9. Cycles in an Undirected Graph
  10. Why doesn’t Dijkstra’s algorithm work for negative weight edges?
  11. Compute the minimal number of swaps to order a sequence
  12. Construct adjacency matrix in MATLAB
  13. Find sets of disjoint sets from a list of tuples or sets in python
  14. Graphviz’s executables are not found (Python 3.4)
  15. What are the practical factors to consider when choosing between Depth-First Search (DFS) and Breadth-First Search (BFS)? [closed]
  16. How to use doxygen to create UML class diagrams from C++ source
  17. Distribute nodes on the same rank of a wide graph to different lines
  18. “RuntimeError: Make sure the Graphviz executables are on your system’s path” after installing Graphviz 2.38
  19. How to find connected components?
  20. Why is the time complexity of both DFS and BFS O( V + E )
  21. Sample Directed Graph and Topological Sort Code [closed]
  22. Why is pydot unable to find GraphViz’s executables in Windows 8?
  23. Find all complete sub-graphs within a graph
  24. Algorithm to simplify a weighted directed graph of debts
  25. What could cause NetworkX & PyGraphViz to work fine alone but not together?
  26. Define graph in Prolog: edge and path, finding if there is a path between two vertices
  27. Finding connected components of adjacency matrix graph
  28. Obtaining connected components of neighboring values
  29. Graphviz + Doxygen to generate UML class diagrams
  30. (Python) ValueError: Program dot not found in path

Leave a Comment