Hierarchy: Difference between revisions
From FreeMind
Jump to navigationJump to search
m (Reverted edit of Yvyfyjeh, changed back to last version by Dan Polansky) |
Dan Polansky (talk | contribs) (revert to last full version) |
||
| Line 1: | Line 1: | ||
Nodes in FreeMind are organized in pure hierarchy: each node other than the single root node has exactly one parent. This contrasts to directed acyclic graphs and to general graphs, found in diagramming software and in drawings of office suites such as MSO Office and OpenOffice.org. | |||
In current FreeMind, nodes located in different branches can be connect using [[arrow link]]s, which satisfies some of the requirements for going beyond hierarchy. | |||
Extensions beyond hierarchy, not yet implemented in current FreeMind, could include having several root nodes in a mind map, having [[node clone]]s, and having nodes with several parent or semi-parent nodes. | |||
==Discussion== | ==Discussion== | ||
* [http://sourceforge.net/projects/freemind/forums/forum/22101/topic/1974798 "Moving beyond pure hierarchy - pros & cons"], 2008-03-18, Open Discussion | * [http://sourceforge.net/projects/freemind/forums/forum/22101/topic/1974798 "Moving beyond pure hierarchy - pros & cons"], 2008-03-18, Open Discussion | ||
Latest revision as of 12:38, 22 November 2010
Nodes in FreeMind are organized in pure hierarchy: each node other than the single root node has exactly one parent. This contrasts to directed acyclic graphs and to general graphs, found in diagramming software and in drawings of office suites such as MSO Office and OpenOffice.org.
In current FreeMind, nodes located in different branches can be connect using arrow links, which satisfies some of the requirements for going beyond hierarchy.
Extensions beyond hierarchy, not yet implemented in current FreeMind, could include having several root nodes in a mind map, having node clones, and having nodes with several parent or semi-parent nodes.
Discussion
- "Moving beyond pure hierarchy - pros & cons", 2008-03-18, Open Discussion
- "Tree versus DAG/Graph", 2003-10-22, Open Discussion
