| 64 | } |
| 65 | |
| 66 | std::list<int> getPathToNode() |
| 67 | { |
| 68 | std::list<int> path; |
| 69 | path.push_back(block); |
| 70 | LosNode *t = parentNode; |
| 71 | while (t) |
| 72 | { |
| 73 | path.push_front(t->block); |
| 74 | t = t->parentNode; |
| 75 | } |
| 76 | |
| 77 | return path; |
| 78 | } |
| 79 | |
| 80 | float costToGetHere; |
| 81 | LosNode *parentNode; |
no outgoing calls
no test coverage detected