Simple orthogonal graph edge routing algorithm

Question

Many graphing applications use orthogonal edge routing for "objects" on a canvas.

I am aware of the brilliant collection of algorithms found in the open source project titled QuickGraph (http://quickgraph.codeplex.com/) but the layout is left to actual layout renderers (such as GraphViz (http://www.graphviz.org) and MSAGL (found on Microsoft store))

Is there a simple algorithm that takes into account the bounds of each object and the anchor points of the end and start points of an edge?

Answer 1

I'm not sure about the algorithm, but I know orthogonal routing (node link rendering, right?) is also called "Manhattan" layout, you may find something more about it under that name.

Answer 2

I think you're looking for a layout algorithm and not a routing algorithm. If you're really looking for a routing algorithm, then something like Open Shortest Path First is a simple one to implement.