____ __ _ __ __ __ __ ____
/ __ \____ __ __/ /____ / | / /___ ____/ /__ / / / /___ _____ ____/ / /__ _____
/ /_/ / __ \/ / / / __/ _ \/ |/ / __ \/ __ / _ \/ /_/ / __ `/ __ \/ __ / / _ \/ ___/
/ _, _/ /_/ / /_/ / /_/ __/ /| / /_/ / /_/ / __/ __ / /_/ / / / / /_/ / / __/ /
/_/ |_|\____/\__,_/\__/\___/_/ |_/\____/\__,_/\___/_/ /_/\__,_/_/ /_/\__,_/_/\___/_/
By Denver Clark || Seperet
-
Handling of nodes for objects such as:
- NPCs
- Vehicles
- and more.
-
Current pathfinding algorithms in use:
- A*
- Dijkstra
-
Navigate to the
srcfolder. -
Current build will be compiled with:
g++ -I ../include *.cpp -o '<out file name>'
-
Or, simply:
g++ -I ../include *.cpp- for a default out file.
-
These 2 compile options use the "Include" -
-Itag to add theincludeproject folder and all other files ending in.cpp(located insrc). -
The compiled out/exe file will then be added into the same folder you are in (
src) - depending on what you specify at compilation.
🚧 If you have any problems with anything, submit an issue to let me know.
-
Version 4.1.0:
-
Updates:
- Modularized pathfinding logic by introducing AStarPathfinder class.
- Added detailed debugging statements with color-coded outputs for better traceability.
- Improved gScore initialization and handling in the A* algorithm to fix pathfinding issues.
-
Expected Output:
-
Starting program... Creating nodes... Initializing node creation with gridSize: 20... Creating Node ID: 0 at (0, 0, 0) Creating Node ID: 1 at (0, 0, 1) Creating Node ID: 2 at (0, 0, 2) ... (***MORE UPDATES***) ... Adding +x neighbor to Node 2865, Neighbor Index: 3265 ... (***MORE UPDATES***) ... Finding path from Node 0 to Node 99... Initiating pathfinding algorithm... Processing Node: 0 Evaluating Neighbor: 400 with tentative gScore: 1 Neighbor: 400 not added, worse gScore. ... No path found. Path from Node 0 to Node 99: ************************* Program finished. Execution time: 17346 ms At: 2024-09-27 01:41:16
-
-
-
Version 4.0.0:
-
Updates:
- Added more robust debugging statements
- Previous pathfinding issues persisted due to incorrect
gScorehandling.
-
Expected Output:
-
Starting program... Creating nodes... Initializing node creation with gridSize: 20... Creating Node ID: 0 at (0, 0, 0) Creating Node ID: 1 at (0, 0, 1) Creating Node ID: 2 at (0, 0, 2) Creating Node ID: 3 at (0, 0, 3) Creating Node ID: 4 at (0, 0, 4) Creating Node ID: 5 at (0, 0, 5) ... ... (***MORE UPDATES***) ... ... Adding +x neighbor to Node 2865, Neighbor Index: 3265 Adding -y neighbor to Node 2865, Neighbor Index: 2845 Adding +y neighbor to Node 2865, Neighbor Index: 2885 Adding -z neighbor to Node 2865, Neighbor Index: 2864 Adding +z neighbor to Node 2865, Neighbor Index: 2866 Adding -x neighbor to Node 2866, Neighbor Index: 2466 ... ... (***MORE UPDATES***) ... ... Finding path from Node 0 to Node 99... Initiating pathfinding algorithm... Processing Node: 0 Evaluating Neighbor: 400 with tentative gScore: 1 Neighbor: 400 not added, worse gScore. Evaluating Neighbor: 20 with tentative gScore: 1 Neighbor: 20 not added, worse gScore. Evaluating Neighbor: 1 with tentative gScore: 1 Neighbor: 1 not added, worse gScore. No path found. Path from Node 0 to Node 99: ************************* Program finished. Execution time: 17346 ms At: 2024-09-27 01:41:16
-
-
-
Version 3.1.0:
-
Updates:
-
Expected Output:
-
Starting program... Initialized 8000 nodes in a 20x20x20 grid. Node ID: 0 at (0, 0, 0) Node ID: 1 at (0, 0, 1) Node ID: 2 at (0, 0, 2) Node ID: 3 at (0, 0, 3) Node ID: 4 at (0, 0, 4) Node ID: 5 at (0, 0, 5) ... ... (***MORE UPDATES***) ... ... Node ID: 7995 at (19, 19, 15) Node ID: 7996 at (19, 19, 16) Node ID: 7997 at (19, 19, 17) Node ID: 7998 at (19, 19, 18) Node ID: 7999 at (19, 19, 19) Simulating traffic... Initiating pathfinding algorithm... Processing Node: 0 No path found. ... ... (***MORE UPDATES***) ... ... Path from Node 0 to Node 99: ************************* Program finished. Execution time: 2298 ms At: 2024-09-27 00:46:18
-
-
-
Version 3.0.0:
-
Updates:
- Slowly implementing dynamic node creation functionality.
-
Expected Output:
-
Starting program... Node ID: 1 at (0, 0, 0) Node ID: 2 at (0, 0, 1) Node ID: 3 at (0, 0, 2) Node ID: 4 at (0, 0, 3) Node ID: 5 at (0, 0, 4) ... ... (***MORE UPDATES***) ... ... Node ID: 7996 at (19, 19, 15) Node ID: 7997 at (19, 19, 16) Node ID: 7998 at (19, 19, 17) Node ID: 7999 at (19, 19, 18) Node ID: 8000 at (19, 19, 19) Simulating traffic... Vehicle 699924208 moved to Node ID:
-
-
-
Version 2.0.0:
-
Updates:
-
Expected Output:
-
Starting program... Initializing nodes... Initializing NPCs... Initializing Vehicles... Simulating traffic... NPC 1 is at Node 1 NPC 2 is at Node 2 NPC 3 is at Node 1 Vehicle 1 is at Node 1 Vehicle 2 is at Node 2 Vehicle 3 is at Node 1 ... ... (***MORE UPDATES***) ... ... NPC 1 is at Node 1 NPC 2 is at Node 2 NPC 3 is at Node 1 Vehicle 1 is at Node 1 Vehicle 2 is at Node 2 Vehicle 3 is at Node 1 ************************* Program finished. Execution time: 0.0164633 seconds At Current time: Wed Sep 25 20:54:28 2024
-
-
-
Version 1.0.0:
-
Updates:
-
Expected Output:
-
Starting program... Initializing nodes... Initializing NPCs... Simulating traffic... NPC1 is at Node 1 NPC2 is at Node 2 NPC3 is at Node 1 NPC1 is at Node 1 NPC2 is at Node 2 ... ... (***MORE UPDATES***) ... ... Program finished.
-
-
- seperet.com || Seperet
- Dijkstra, A*, and Topological Sort || CS106B Lecture 27. Dijkstra, A*, and Topological Sort
- Welcome, welcome.