Timeline for Runtime of algorithm to transpose a graph
Current License: CC BY-SA 3.0
4 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Oct 19, 2016 at 20:36 | vote | accept | CommunityBot | ||
| Oct 19, 2016 at 18:28 | comment | added | David Richerby | Do you even need an algorithm to do this? In many contexts, you can just have a Boolean field for "The edges go the other way, now." Now, transposing the graph is $O(1)$ (flip the Boolean), and any algorithms that use your graph data structure just need to check the Boolean and behave appropriately. | |
| Oct 19, 2016 at 18:09 | answer | added | Yuval Filmus | timeline score: 7 | |
| Oct 19, 2016 at 17:11 | history | asked | user40759 | CC BY-SA 3.0 |