Timeline for An efficient algorithm to find a shortest cycle including a specific vertex
Current License: CC BY-SA 3.0
3 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jun 18, 2021 at 6:00 | comment | added | Shaull | @Null_Space - an undirected graph is a special case of a directed graph (with the edge relation is symmetric). Also, an undirected graph has a cycle iff it has an edge, because you can go back and forth. | |
| Jun 17, 2021 at 20:50 | comment | added | Null_Space | I think your algorithm only works when the underlying graph is directed | |
| May 20, 2016 at 21:39 | history | answered | Shaull | CC BY-SA 3.0 |