Hi @AlBar,
Finding the maximum length path is an NP-hard problem (except maybe directed acyclic graphs). One thing you could try is inverting the edge weights (so, 5 → -5) and then use the shortest path algorithm. Though this would only give you one path and not all the paths.