Differences between current version and previous revision of SpringGraph.
Other diffs: Previous Major Revision, Previous Author, or view the Annotated Edit History
| Newer page: | version 2 | Last edited on Sunday, April 25, 2004 9:05:12 pm | by StuartYeates | |
| Older page: | version 1 | Last edited on Saturday, April 24, 2004 11:14:36 am | by JohnMcPherson | Revert |
@@ -9,4 +9,11 @@
(which can then be used to create [PDF]s) available for download at
http://www.wlug.org.nz/archive/software/springgraph/.
A example [PDF] file of the [WLUG] WebOfTrust (from JohnMcPherson's point of view) is [available here|http://www.wlug.org.nz/archive/software/springgraph/example-jrm-keyring.pdf].
+
+----
+There are a number of issues with this approach to this method of generating graphs. The first is that it depends on
+
+ gpg --list-sigs
+
+which is n^2 time complexity with the number of keys and consumes considerable memory for large keyrings. The second is that springgraph itself has at least exponential time complexity (and appears to perform particularly bad when there are many diconnected signatures). So while this is a good technique for graphing your local sub-graph, using it to graph your place in the over-all WebOfTrust isn't so cunning.
