Microsoft Automatic Graph Layout: Difference between revisions

Revision as of 07:46, 23 August 2023

Latest revision as of 11:50, 6 August 2025

(7 intermediate revisions by 5 users not shown)

Line 21:

== Contents ==

The MSAGL software supplies threefour programming libraries:

* {{mono|Microsoft.MSAGL.dll}}, a device-independent [[graph layout]] engine;

Line 31:

== Features ==

MSAGL performs layout based on ''"principles of the [[Sugiyama scheme]];<ref>{{Citecite urlweb|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]].

Line 51:

== External links ==

* [http://research.microsoft.com/en-us/projects/msagl/ MSAGL home page]

* [http://rise4fun.com/agl/ MSAGL in a browser] {{dead link|date=August 2025}}

* [httphttps://wwwpatents.google.com/patents?id=cyqbAQAAEBAJ&dq=7932907patent/US7932907 US Patent 7932907]

{{Graph Analysis Software}}