How to solve graph scheduling problems.
- While this can be solved using a variety of different languages, this case is about using the R environment and Optrees package.
- The idea is to do it faster and practical fashion.
- The data is represented as a DAG(Directed Acyclic Graph)
- The algorithm use graph representation and use Djasktra's ShortestPath Algorithm
The corresponding R code is attached !!
Using R and Optrees package to solve graph problems