Pathfinder
Search.h
Go to the documentation of this file.
1 
10 #ifndef SEARCH_H
11 #define SEARCH_H
12 
13 #include <EScript/EScript/Objects/Collections/Array.h>
14 
15 namespace Pathfinder {
16 
29  boost::optional<std::pair<Vertex, Vertex>>
31  const Geometry::Vec3& start,
32  const Geometry::Vec3& goal,
33  const Graph* graph
34  );
35 
36 
48  EScript::Array*
49  findPath(
50  const MinSG::ListNode& root,
51  const Geometry::Vec3& start,
52  const Geometry::Vec3& goal,
53  const short& agent
54  );
55 
56 
57 }
58 
59 #endif
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
Definition: AABB.cpp:21
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