/finding_longest_paths_in_DAG

finding the longest path in a directed acyclic graph

Primary LanguagePython

#README

5<-(this is # of vertices) 7 <- this is # of edges

1 2 7 <-(these are in the form: from vertex, to vertex, weight)
1 3 10
2 4 8
2 5 3
3 4 5
3 5 10
4 5 5