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 other topics 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 * (n - 1) / 2''' associations (edges) | ||
Revision as of 10:16, 13 June 2007
Fully connected graph generator creates topic map where each topic is connected to every other topics 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 * (n - 1) / 2 associations (edges)
