How to solve the shortest Short Circuit in HDU Graph Theory

Hdu1385: http://acm.hdu.edu.cn/showproblem.php? PID = 1, 1385

This question is to let you find the minimum cost. What is more difficult is that it is not only the Shortest Path of the edge weight value, but also the Shortest Path of the Edge Weight Value + vertex weight value, in fact, you just need to add steps. The key here is to record the path, because the question requires you to output it in Lexicographic Order, for example, path 1--3--4--5 and path 1-2--3--4. If the two paths are the same, output the latter. Because it is in the Lexicographic Order, we need to record the successor of the vertex when recording the path, rather than the precursor of the vertex. Once we record the precursor of the vertex, some situations may lead to errors. This requires careful consideration.

Hdu2807: http://acm.hdu.edu.cn/showproblem.php? PID = 1, 2807

This is also the most short-circuit problem, mainly the problem of Matrix Multiplication. The product of two matrices is obtained in a general way, and its efficiency is very low, so the efficiency of converting a two-dimensional matrix into a one-dimensional matrix is much faster, and then it is the simplest and most short-circuit problem.