13 #include <EScript/EScript/Objects/Collections/Array.h> 29 boost::optional<std::pair<Vertex, Vertex>>
31 const Geometry::Vec3& start,
32 const Geometry::Vec3& goal,
50 const MinSG::ListNode& root,
51 const Geometry::Vec3& start,
52 const Geometry::Vec3& goal,
EScript::Array * findPath(const MinSG::ListNode &root, const Geometry::Vec3 &start, const Geometry::Vec3 &goal, const short &agent)
Do the scene analysis and pathfinding.
Definition: Search.cpp:70
boost::adjacency_list< boost::vecS, boost::vecS, boost::undirectedS, GraphVertex, GraphEdge > Graph
Shorthand notation for the graph used.
Definition: Using.h:42
boost::optional< std::pair< Vertex, Vertex > > findStartGoal(const Geometry::Vec3 &start, const Geometry::Vec3 &goal, const Graph *graph)
Given 2 points in 3D space, approximate these points by nodes in the graph while adhering to a maximu...
Definition: Search.cpp:28