3 ms·
Did anyone see the new pathing algorithm for connecting graph nodes that made some rounds on twitter? It looked way better than a normal force-directed graph.
by undershirt 5y ago
Did anyone see the new pathing algorithm for connecting graph nodes that made some rounds on twitter? It looked way better than a normal force-directed graph. I can’t remember what it was exactly, and have lost the reference, but it was a side effect of solving what looked like a traffic problem.
- inciampati 5y agoStochastic gradient descent optimization of the layout based on distances in walks in the graph?
- graphviz 5y agoDo you mean Yu, Schumacher and Crane's repulsive curves, as shown in figure 26 of https://www.cs.cmu.edu/~kmcrane/Projects/RepulsiveCurves/RepulsiveCurves.pdf https://www.cs.cmu.edu/~kmcrane/Projects/RepulsiveCurves/Rep... ?
- undershirt 5y agothat's it, thank you! i suppose graphviz will have this eventually