Structure of Astar (A*) graph search data in C#
Posted
by
Shawn Mclean
on Stack Overflow
See other posts from Stack Overflow
or by Shawn Mclean
Published on 2010-12-25T23:03:23Z
Indexed on
2010/12/26
16:54 UTC
Read the original article
Hit count: 173
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.
© Stack Overflow or respective owner