I am only able to get one shortest path with this but I know that by counting the nodes there are multiple equally shortest paths present.
My question is, how can I get all the equally shortest paths (so that I can find the most optimized and evasive route for an escaping ncp character, such as for this game )?
This is not possible out of the box, in this package. You could possibly do it with a custom path type, but it would be a bit tricky, still.
A better option might be to bias the path search using an ITraversalProvider. See Agent-Specific Pathfinding - A* Pathfinding Project