Notes
This function is in beta test. Please help improve it in the issues
here.
Hints
Your answer may be identical to the JOJ answer in the first several lines.
However, the main problem you meet now is Memory Exceeded.
Please double check your code to solve this problem and try again.
Your Answer
No path exists! The graph is not a DAG No MST exists!
JOJ Answer
Shortest path length is 5176 The graph is not a DAG No MST exists!