Fully connected graph generator - Revision history

Akivela at 16:02, 13 April 2012

2012-04-13T16:02:39Z

2008-04-03T15:19:54Z

2008-04-03T15:18:49Z

2008-01-29T15:35:50Z

2007-12-12T14:33:48Z

2007-12-12T14:32:46Z

2007-08-11T09:18:50Z

2007-06-13T07:42:16Z

2007-06-13T07:36:43Z

2007-06-13T07:16:50Z

← Older revision		Revision as of 16:02, 13 April 2012
Line 9:		Line 9:


−	== ~~Read more~~ ==	+
		+	== See also ==

	* http://en.wikipedia.org/wiki/Complete_graph		* http://en.wikipedia.org/wiki/Complete_graph
		+	* To visualize the complete graph, you can try the [[Graph topic panel]] or [[Processing topic panel]].
		+	* To export the graph:
		+	** [[GraphML export]]
		+	** [[Graph Modeling Language export]]
		+	** [[GraphXML export]]
		+	** [[Export adjacency matrix]]
		+	** [[Export incidence matrix]]

@@ Line 4: / Line 4: @@
 * 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.
-Below is a graph visualization of complete graph with x topics. Visualization was created with Wandora's graph topic panel. Notice the visualization doesn't contain topic's associations to itself.
+Below is a graph visualization of complete graph with 7 topics. Visualization was created with Wandora's [[Topic_panels|graph topic panel]]. Notice the visualization doesn't contain topic's associations to itself.
 [[Image:fully_connected_graph_example.gif|center]]

@@ Line 3: / Line 3: @@
 * 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.
 [[Image:fully_connected_graph_example.gif|center]]

@@ Line 3: / Line 3: @@
 * 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.
 == Read more ==
 * http://en.wikipedia.org/wiki/Complete_graph

← Older revision		Revision as of 14:33, 12 December 2007
Line 3:		Line 3:
	* 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 of fully connected graph. 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.
		+
		+	== Read more ==
		+
		+	* http://en.wikipedia.org/wiki/Complete_graph

@@ Line 1: / Line 1: @@
-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
+Fully connected graph generator creates topic map where each topic is connected to every topic (including itself) via binary association. Maximally connected graph is also called as ''complete graph''. 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.

← Older revision		Revision as of 09:18, 11 August 2007
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.

← Older revision		Revision as of 07:42, 13 June 2007
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.	+	* 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.

← Older revision	Revision as of 07:16, 13 June 2007
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)