Microsoft Automatic Graph Layout: Difference between revisions

Revision as of 08:25, 16 October 2021

Latest revision as of 11:50, 6 August 2025

(19 intermediate revisions by 10 users not shown)

Line 1:

{{Short description|Software library}}

{{Infobox software

| name = Microsoft Automatic Graph Layout (MSAGL)

| author = Lev Nachmanson, Sergey Pupyrev, Tim Dwyer, Ted Hart, Roman Prutkin

| developer = [[Microsoft Research]]

| released = {{Start date and age|2015|02|26}}

| latest release version = v1.1

| latest release date = {{Start date and age|2022|01|28}}

| repo = {{URL|https://github.com/Microsoft/automatic-graph-layout}}

| programming language = [[C Sharp (programming language)|C#]]

Line 15 ⟶ 16:

}}

'''Microsoft Automatic Graph Layout''' (MSAGL) is a [[.NET Framework|.NET]] library for automatic [[graph layout]].

It was created by Lev Nachmanson at [[Microsoft Research]].<ref>{{cite web |title=Microsoft Automatic Graph Layout |url=https://www.microsoft.com/en-us/research/project/microsoft-automatic-graph-layout/ |website=Microsoft Research}}</ref>

Earlier versions carried the name ''GLEE'' ('''Graph Layout Execution Engine''').<ref>{{cite web |title=Visualize Custom Graph with MS Graph Layout Engine |url=https://www.syncfusion.com/blogs/post/visualize-custom-graph-ms-graph-layout-engine.aspx |website=Syncfusion Blogs |date=14 August 2018}}</ref>

== Contents ==

The MSAGL software supplies threefour programming libraries:

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

Line 30 ⟶ 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]].

It does not appear to support [[incremental layout]].<ref>{{cite web |title=Microsoft Automatic Graph Layout {{!}} Semantic Scholar |url=https://www.semanticscholar.org/topic/Microsoft-Automatic-Graph-Layout/2926312 |website=www.semanticscholar.org |language=en}}</ref>

It does not appear to support [[incremental layout]].

== Availability and licensing ==

MSAGL is distributed under [[MIT License]] as open source at [[GitHub]].<ref>{{Cite web|url=https://github.com/Microsoft/automatic-graph-layout.git|title = Microsoft Automatic Graph Layout| website=[[GitHub]] |date = 17 October 2021}}</ref>

== See also ==

Line 50 ⟶ 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}}

{{Microsoft FOSS}}

{{Microsoft Research}}

Line 58 ⟶ 60:

[[Category:Graph drawing software]]

[[Category:Free and open-source software]]

[[Category:Microsoft free software|Automatic Graph Layout]]

[[Category:Microsoft Research]]

[[Category:Programming tools for Windows]]

[[Category:Software using the MIT license]]

[[Category:Windows-only free software]]