* Represents a step in the path from node A to node B.
| 203 | * Represents a step in the path from node A to node B. |
| 204 | */ |
| 205 | interface Step { |
| 206 | /** |
| 207 | * The cost of the steps after this step. |
| 208 | */ |
| 209 | cost: number; |
| 210 | |
| 211 | /** |
| 212 | * The edge associated with this step. |
| 213 | */ |
| 214 | edge?: Edge; |
| 215 | |
| 216 | /** |
| 217 | * The next step. |
| 218 | */ |
| 219 | next?: Step; |
| 220 | } |
| 221 | |
| 222 | /** |
| 223 | * Finds the shortest cost path from node A to node B. |
nothing calls this directly
no outgoing calls
no test coverage detected
searching dependent graphs…