How to find the longest path from one node to another in a sufficiently large network

Everyone, I have a question. I need to find the longest path from one node to another in the network. As shown in the figure, it is a directed network, and I currently have no idea how to implement it in the “KNIME” tool. The figure is just a simple example. If the quantity is large enough, how should I implement it.

How to implement without using programming tools such as Python or R?

The figure only shows the following results: node 1 to node 4, node 1 to node 3; Node 5 to Node 4