151.Take print solution out, done; (2018-7-18)
152.Add previous to shortest path, done; print path from source to node, done; (2018-7-18)
153.Try to change source for shortest path, done; (2018-7-18)
154.It is not dfs of tree, but dfs of graph; (2018-7-19)
155.Delete previous in 1087, done; (2018-7-20)
156.Find code of merge sort, done; (2018-7-21)
157.Delete arr in parameter, done; (2018-7-21)
158.Delete n in print, done; delete n in merge sort, done; (2018-7-21)
159.Change merge vector into 1089’s vector, done; (2018-7-22)
151.Take print solution out, done; (2018-7-18) 152.Add previous to shortest path, done; print path from source to node, done; (2018-7-18) 153.Try to change source for shortest path, done; (2018-7-18) 154.It is not dfs of tree, but dfs of graph; (2018-7-19) 155.Delete previous in 1087, done; (2018-7-20) 156.Find code of merge sort, done; (2018-7-21) 157.Delete arr in parameter, done; (2018-7-21) 158.Delete n in print, done; delete n in merge sort, done; (2018-7-21) 159.Change merge vector into 1089’s vector, done; (2018-7-22)