Automatic Graph Layout 2007 Calendar
MSAGL is a.NET tool for graph layout and viewing directed graphs. It was developed in Microsoft Research by Lev Nachmanson. MSAGL is built on the principle of the Sugiyama scheme; it produces so called layered, or hierarchical layouts. This kind of a layout naturally applies to graphs with some flow of information.
The graph could represent a control flow graph of a program, a state machine, a C class hierarchy, etc.The MSAGL home page isMSAGKL is not free, it must be purchased. It can be purchased.Code samples can be found.Another FAQ can be found. I have a few licensing questions, which i cannot find anwers in any FAQ or EULA:1) If we use the MSDN download 'Research Automatic Graph Layout' aloing with its static key, it reports the redistributable files as 'Microsoft.GLEE.dll' whereas their real name is 'Microsoft.agl.dll' etc. I suppose that is not a problem?2) does the license to use and destribute expire if the MSDN abo using to acquire it does?2) the msi contains the source code for 'Microsoft.agl.Drawing' and 'Microsoft.agl.GraphViewerGdi'. Are we allowed to change that and distribute the resulting changed compiled code, say, using a different name for the components?
Automatic Graph Layout
The EULA ist notclear on this point. First it refers to REDIST.TXT, but later it prohibits modification and distribution of modification only if no GPL-like license gets attached.Thank you!- Walter Knupe.
Microsoft Automatic Graph Layout
Can also play with AGL at rise4fun.com/Agl and see graphs from others there atmaybe that is a simple option for testing and brainstorming, but you only enter the graph in text form there and the labels you use for nodes are used as IDs in that text syntax, so I guess you can't have a node with the same label (say House) at two placesin the graph. Seems you can also use labels for edges of the graph too (for the links), using the syntax shown at rise4fun.com/Agl/fsm (press PLAY button there and then scroll down to see what graph is generated)Microsoft MVP J# 2004-2010, Borland Spirit of Delphi 2001.
Free Graph Layout
Basically the game plan would be to:Identify and set a reference to the data to be copied. Just how this is determined is dependent on your rules to figure out what data segments (range(s)) need to be copied.