Structure of Astar (A*) graph search data in C#
- by Shawn Mclean
How do you structure you graphs/nodes in a graph search class? I'm basically creating a NavMesh and need to generate the nodes from 1 polygon to the other. The edge that joins both polygons will be the node.
I'll then run A* on these Nodes to calculate the shortest path. I just need to know how to structure my classes and their properties?
I know for sure I wont need to create a fully blown undirected graph with nodes and edges.