Nodes, cycles and paths

Given below is a directed graph:

Let's say that the length of a path is the number of nodes in this path (including the start and the end nodes). What are the shortest and the longest simple paths between the nodes $0$ and $6$?

Print the answers in the field below. The expected output format is the following:

0 2 1 5
0 4 3 1 5

The first line corresponds to the shortest path, and the second one represents the longest path.