Routine waypoint based pathfinding POC

[BoroBongo]

This change implements a global access to the FindFastestPath method in the DijkstraPathFinder static class. This allows any part of the code* to find the fastest path between two waypoints using Dijkstra's algorithm.

🚨 * Earliest it can be called is right after the WaynetCreator runs and Waypoint GameObject have been created 🚨

To test

1. While debugging with breakpoints - recreate steps in this video:

Checklist

1. Make Bloodwyn calculate one of his routines and start patroling ( Hopefully a big difference in immersion )

Scene

• [ ] FeatureFlags reverted to right value

Testing

• [ ] Merged main into this branch and tested with the latest features
• [ ] Tested with PCVR
• [ ] Tested with Pico / Quest

Dependencies

• [ ] If libphoenix-shared.dll is changed, .so is also changed

[JaXt0r]

I integrated the path finder into existing WaynetCreator.cs / WaynetHelper.cs.

Still need to test the Dijkstra*Debug.cs method and see if the calculations are still there.

[JaXt0r]

I already tested it and use it in another branch. I merge it now.