Timeline for Family Tree Solver
Current License: CC BY-SA 3.0
3 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Aug 28, 2014 at 7:09 | comment | added | Optokopper | Yes, it is Dijkstra's Shortest Path. It starts one Dijkstra instance at a and one at b and terminates when both searches meet. | |
| Aug 28, 2014 at 2:52 | comment | added | Scott Leadley | Is that an implementation of Dijkstra's Shortest Path Algorithm hiding in the middle? | |
| Aug 27, 2014 at 23:53 | history | answered | Optokopper | CC BY-SA 3.0 |