Fully connected graph generator
From WandoraWiki
(Difference between revisions)
| Line 2: | Line 2: | ||
* Shortest path length between any topics is 1 | * Shortest path length between any topics is 1 | ||
| − | * if '''n''' is number of topics then fully connected topic map contains '''n * ( 1 + ((n - 1) / 2))''' associations (edges). For example a fully connected graph with 100 topics has 5050 associations. Note that literature often gives you a formula '''n * (n - 1) / 2''' for the edge count. The difference between our and literature formula follow the design decision where topic may be connected to itself also. | + | * if '''n''' is number of topics then fully connected topic map contains '''n * ( 1 + ((n - 1) / 2))''' associations (edges). For example a fully connected graph with 100 topics has 5050 associations. Note that literature often gives you a formula '''n * (n - 1) / 2''' for the edge count of fully connected graph. The difference between our and literature formula follow the design decision where topic may be connected to itself also. |
Revision as of 12:18, 11 August 2007
Fully connected graph generator creates topic map where each topic is connected to every topic (including itself) via binary association. Properties of fully connected topic map include
- Shortest path length between any topics is 1
- if n is number of topics then fully connected topic map contains n * ( 1 + ((n - 1) / 2)) associations (edges). For example a fully connected graph with 100 topics has 5050 associations. Note that literature often gives you a formula n * (n - 1) / 2 for the edge count of fully connected graph. The difference between our and literature formula follow the design decision where topic may be connected to itself also.
