Finding all paths between two points in a directed graph

Take this picture as an example ：

Solve all paths between two points in a directed graph

It mainly adopts the idea of depth traversal ：

#  Enter the number of vertices 
vertex_num = int(input())
#  Enter the number of edges 
edge_num = int(input())
#  Enter the starting point 
start = int(input())
#  Enter the destination 
end = int(input())
#  Initialize adjacency matrix 
graph = [[0 for _ in range(vertex_num)] for _ in range(vertex_num)]
#  initialization visit Array  --  Used in dfs Record the accessed vertex information in 
visit = [0 for _ in range(vertex_num)]
#  Store every possible path 
path = []
#  Store final path collection 
result_path = []
#  Create diagrams 
for i in range(edge_num):
    #  Input path (0 1  Express ： 0 You can go to 1)
    a_list = input().split(" ")
    graph[int(a_list[0])][int(a_list[1])] = 1


def dfs(start):
    #  Express start Point has been visited 
    visit[start] = 1
    #  The visited points are put into path list 
    path.append(start)
    #  If the current visited point is the destination , Join in result_path
    if start == end:
        result_path.append(path[:])
    else:  #  Recursive traversal 
        i = 0
        while i < vertex_num:
            if visit[i] == 0 and i != start and graph[start][i] != 0:
                dfs(i)
            i = i + 1
    #  Clear one by one after recursion path In the point , Prepare for the next path 
    path.remove(path[-1])
    #  Reset the point to 0, I.e. no access status 
    visit[start] = 0


dfs(start)
print(result_path)

Input ：
5
6
0
2
0 1 1
0 2 2
0 3 1
1 2 1
2 4 1
3 4 1

Output ：
[[0, 1, 2], [0, 2]]