Timeline for Implementing a Forest Data Structure in Java
Current License: CC BY-SA 3.0
8 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Nov 8, 2015 at 22:32 | comment | added | Andras Zoltan | This answer is a great demonstration of how to apply computer science to real-world by examining the problem and matching it up with well-known algorithms and data structures. Very nice :) | |
| Sep 15, 2015 at 17:26 | comment | added | Tj895 | Do you have any advice on where to start? At the moment I am reading about graphs on "Modern Software Development Using Java: Paul T. Tymann and G. Michael Schneider". | |
| Sep 14, 2015 at 12:21 | comment | added | Frank | There is no generic "best" in software engineering. You can hand-code it, you can choose one of the 2355113 (rough estimate) graph libraries.. a lot more info is needed for this decision and it's probably not one that SE can help you with. | |
| Sep 14, 2015 at 11:47 | comment | added | Tj895 | Would this be the best way of commencing implementation for a DAG? stackoverflow.com/questions/15460661/… | |
| Sep 14, 2015 at 7:27 | comment | added | Frank | Yes, sharing the same parent is no problem in a DAG, since it is just another connection between the corresponding nodes. Dijkstra's and Bellman Ford are algorithms as opposed to data structures. They are possible ways to work with a graph once you have one. | |
| Sep 14, 2015 at 7:11 | comment | added | Tj895 | Also, Djikstra's Algorithm and Bell-man Ford would be a practical example of a DAG if I am not mistaken? Please feel free to correct me. | |
| Sep 14, 2015 at 7:05 | comment | added | Tj895 | Thank you Frank for the suggestion. I will look further into graphs as you advised, hypothetically say if I were to use a graph or in this instance a DAG would I be able to allow a child node to share the same parent as another child, therefore implementing half siblings? | |
| Sep 14, 2015 at 6:55 | history | answered | Frank | CC BY-SA 3.0 |