Differences between version 2 and previous revision of GraphTheory.
Other diffs: Previous Major Revision, Previous Author, or view the Annotated Edit History
| Newer page: | version 2 | Last edited on Monday, October 20, 2003 3:51:53 pm | by StuartYeates | Revert |
| Older page: | version 1 | Last edited on Monday, October 20, 2003 2:38:23 pm | by StuartYeates | Revert |
@@ -1,9 +1,7 @@
The theory of graphs.
-A graph is a set of ``vectrices``
connected by ``
edges.``
The edges may or may not be ``
directed.``
+A graph is a set of ''vertices''
connected by ''
edges.''
The edges may or may not be ''
directed.''
One of the famous examples used in GraphTheory is the BridgesOfKönigsberg.
-GraphTheory is widely used in computer science for things like call graphs, algorithms
and so forth.
-
-See also:
SetTheory
+GraphTheory is widely used in computer science for things like call graphs, [Algorithm]s
and so forth. GraphTheory relies heavily on
SetTheory, and many common algorithms involve partitioning (or colouring) vertices into sets.
