- Timestamp:
- Apr 21, 2019, 11:30:41 PM (5 years ago)
- File:
-
- 1 edited
Legend:
- Unmodified
- Added
- Removed
-
code/branches/3DPacman_FS19/src/modules/pacman/PacmanGhost.h
r12318 r12319 99 99 public: //HACK 100 100 101 struct graphVertex; 102 void findNeighboorVertices(Vector3 actuelposition, graphVertex* adjacentVertices[]); 103 void updateShortestDistanceToStart(graphVertex &vertex, graphVertex &neighboor); 104 void findNearestNonVisitedNeighboor (graphVertex &vertex); 105 int graphDistance(Vector3 start, Vector3 goal); 101 */ 106 102 107 graphVertex* findNextVertexToConsider(graphVertex listOfVerticesP[]);*/ 108 109 struct graphVertex; 103 /*struct graphVertex; 110 104 void findNeighboorVertices(Vector3 actuelposition, graphVertex* adjacentVertices[], graphVertex listOfVerticesP2[]); 111 105 void updateShortestDistanceToStart(graphVertex &vertex, graphVertex &neighboor); … … 114 108 115 109 graphVertex* findNextVertexToConsider(graphVertex listOfVerticesP[]); 116 Vector3 getShortestPath(Vector3 start, Vector3 goal); 110 Vector3 getShortestPath(Vector3 start, Vector3 goal);*/ 111 112 struct graphVertex; 113 void findNeighboorVertices(Vector3 actuelposition, graphVertex* adjacentVertices[], graphVertex listOfVerticesP2[]); 114 void updateShortestDistanceToStart(graphVertex &vertex, graphVertex &neighboor); 115 void findNearestNonVisitedNeighboor (graphVertex &vertex, Vector3 pointToAvoidP3=Vector3(0,0,0)); 116 int graphDistance(Vector3 start, Vector3 goal); 117 118 graphVertex* findNextVertexToConsider(graphVertex listOfVerticesP[], Vector3 pointToAvoidP2=Vector3(0,0,0)); 119 Vector3 getShortestPath(Vector3 start, Vector3 goal, Vector3 pointToAvoidP1=Vector3(0,0,0)); 120 117 121 118 122 … … 126 130 bool playerFindPos(Vector3 one, Vector3 other); 127 131 132 bool jeanfindpos(Vector3 one, Vector3 other); 133 134 void setNewTargetGhost(Vector3 goalToGo); 135 128 136 129 137 };
Note: See TracChangeset
for help on using the changeset viewer.