I agree. I wanted to explore "graph pageing". The problem with computer screens and large graphs is that they're awkward to navigate because the viewport is smaller than the graph, and you can only scale the entire graph so much. You could pan around a large graph but it is not ideal, it's kind of awkward.
I wrote a graph layout algorithm here but it makes no attempt to prevent overlapping.
I agree. I wanted to explore "graph pageing". The problem with computer screens and large graphs is that they're awkward to navigate because the viewport is smaller than the graph, and you can only scale the entire graph so much. You could pan around a large graph but it is not ideal, it's kind of awkward.
I wrote a graph layout algorithm here but it makes no attempt to prevent overlapping.
https://ibb.co/1ZZFtVF
https://replit.com/@Chronological/Processes3#public/index.ht... (scroll down to "Graph" on a desktop computer)
I would like to write an algorithm that "pages" a graph and when you scroll it composits different nodes in-and-out as you scroll.