Fully connected graph generator
From WandoraWiki
(Difference between revisions)
| Line 1: | Line 1: | ||
| − | Fully connected graph generator creates topic map where each topic is connected to every | + | 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 | * Shortest path length between any topics is 1 | ||
| − | * if '''n''' is number of topics then fully connected topic map contains '''n * (n - 1) / 2''' associations (edges) | + | * 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. |
Revision as of 10:36, 13 June 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.
