[Algorithmic] Finding the longest simple path between two nodes on a digraph

Currently i have a graph with 500 nodes and I am having trouble coming up with an effective algorithm that yields the result of the longest simple path between two nodes in a directed weightless cyclic graph. Have anyone else come across a question like this?

I have already tried a brute force algorithm that traverses all paths possible, however it breaks after ~15 nodes.