- Timestamp:
- Apr 20, 2019, 5:22:51 PM (5 years ago)
- File:
-
- 1 edited
Legend:
- Unmodified
- Added
- Removed
-
code/branches/3DPacman_FS19/src/modules/pacman/PacmanGhost.h
r12304 r12316 36 36 #include "worldentities/ControllableEntity.h" 37 37 38 #include "Pacman.h" 39 #include "GetShortestPathAlgorithm.h" 40 38 41 namespace orxonox { 39 42 … … 43 46 44 47 45 struct graphVertex;46 void findNeighboorVertices(Vector3 actuelposition, graphVertex adjacentVertices[]);47 void updateShortestDistanceToStart(graphVertex &vertex, graphVertex &neighboor);48 graphVertex findNextVertexToConsider(graphVertex[]);49 48 50 extern graphVertex listOfVertices[];51 49 52 50 … … 83 81 bool lockmove = false; 84 82 85 Vector3 getShortestPath(Vector3 start, Vector3 goal);83 /*Vector3 getShortestPath(Vector3 start, Vector3 goal); 86 84 87 85 Vector3 setPureArrayPos(Vector3 &posToSet); 88 86 89 private: 87 */Vector3 getPlayerPos(); 88 89 Vector3 playerPos; 90 91 Vector3 lastPlayerPassedPoint;/* 92 93 //Vector3 pathAlgorithm; 94 95 public: //HACK 96 97 struct graphVertex; 98 void findNeighboorVertices(Vector3 actuelposition, graphVertex* adjacentVertices[]); 99 void updateShortestDistanceToStart(graphVertex &vertex, graphVertex &neighboor); 100 void findNearestNonVisitedNeighboor (graphVertex &vertex); 101 int graphDistance(Vector3 start, Vector3 goal); 102 103 graphVertex* findNextVertexToConsider(graphVertex listOfVerticesP[]);*/ 104 105 struct graphVertex; 106 void findNeighboorVertices(Vector3 actuelposition, graphVertex* adjacentVertices[], graphVertex listOfVerticesP2[]); 107 void updateShortestDistanceToStart(graphVertex &vertex, graphVertex &neighboor); 108 void findNearestNonVisitedNeighboor (graphVertex &vertex); 109 int graphDistance(Vector3 start, Vector3 goal); 110 111 graphVertex* findNextVertexToConsider(graphVertex listOfVerticesP[]); 112 Vector3 getShortestPath(Vector3 start, Vector3 goal); 113 114 90 115 }; 91 116
Note: See TracChangeset
for help on using the changeset viewer.