Timeline for Reduce the number of edges of a graph, keeping it connected
Current License: CC BY-SA 2.5
9 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Nov 23, 2010 at 16:43 | answer | added | user3446 | timeline score: 1 | |
| Nov 23, 2010 at 8:55 | vote | accept | Splo | ||
| Nov 23, 2010 at 8:54 | history | edited | Splo | CC BY-SA 2.5 | Changed "complete" to "connected". |
| Nov 23, 2010 at 8:53 | comment | added | Splo | Binary search tree, connected graph, right. I'm so bad with conventional name of things. | |
| Nov 22, 2010 at 23:21 | answer | added | Sparr | timeline score: 0 | |
| Nov 22, 2010 at 20:16 | comment | added | Michael Madsen | FYI: A complete graph has edges between all pairs of vertices, so (assuming duplicate edges are not allowed) you can't remove any edges and still have a complete graph. The right term is a connected graph. | |
| Nov 22, 2010 at 19:01 | comment | added | PrettyPrincessKitty FS | Your idea is basically a binary search tree, if you want to know. I used it; it does make rather nice dungeons and is easy. :) | |
| Nov 22, 2010 at 18:59 | answer | added | r2d2rigo | timeline score: 14 | |
| Nov 22, 2010 at 18:27 | history | asked | Splo | CC BY-SA 2.5 |