Microsoft Automatic Graph Layout: Difference between revisions

Revision as of 17:10, 9 June 2024

Revision as of 04:06, 18 July 2024

Line 31:

== Features ==

MSAGL performs layout based on ''principles of the [[Sugiyama scheme]];<ref>{{cite web|url=https://www.microsoft.com/en-us/research/publication/notes-on-an-implementation-of-sugiyamas-scheme/|title = Notes on an Implementation of Sugiyama's Scheme|date = June 2006|last1 = Nachmanson|first1 = Lev| website=[[Microsoft]] }}</ref> it produces so called layered, or hierarchical, layouts'' (according to the MSAGL home page). ModifiedA modified [[Coffman–Graham algorithm|Coffman–Graham scheduling algorithm]] is then used to find a layout that would fit in a given space. More detailed description of the algorithm can be found in {{US Patent |7932907}}.

At some time, it did not support a wide range of different layout algorithms, unlike, for instance, [[GraphViz]] or [[GUESS Graph Exploration System|GUESS]].