Timeline for Why isn't an edge-map graph implementation used in practice?
Current License: CC BY-SA 4.0
10 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| S Dec 12, 2021 at 16:37 | history | edited | Caleb Stanford | CC BY-SA 4.0 |
improved writing and tags
|
| S Dec 12, 2021 at 16:37 | history | suggested | Matthieu Latapy | CC BY-SA 4.0 |
improved writing and tags
|
| Dec 11, 2021 at 21:42 | review | Suggested edits | |||
| S Dec 12, 2021 at 16:37 | |||||
| Jul 1, 2019 at 15:25 | answer | added | Juho | timeline score: 2 | |
| Jul 1, 2019 at 15:20 | answer | added | John L. | timeline score: 6 | |
| Jun 30, 2019 at 9:00 | history | tweeted | twitter.com/StackCompSci/status/1145255783849975809 | ||
| Jun 29, 2019 at 22:27 | comment | added | Derek Elkins left SE | This is basically an adjacency matrix representation but utilizing a sparse matrix representation. | |
| Jun 29, 2019 at 21:56 | comment | added | David Richerby | Terrible cache performance when enumerating the neighbours of a vertex would be one drawback. That's a very common operation in algorithms. | |
| Jun 29, 2019 at 21:30 | review | First posts | |||
| Jun 30, 2019 at 1:15 | |||||
| Jun 29, 2019 at 21:25 | history | asked | timotree | CC BY-SA 4.0 |