Stark::ShortestPath Class Reference

#include <shortestpath.h>

Public Types
typedef Common::List< const Resources::FloorEdge * >	NodeList

Public Member Functions
NodeList	search (const Resources::FloorEdge *start, const Resources::FloorEdge *goal)

Detailed Description

Find the shortest path between two nodes in a graph

This is an implementation of Dijsktra's search algorithm

Member Function Documentation

search()

NodeList Stark::ShortestPath::search	(	const Resources::FloorEdge *	start,
		const Resources::FloorEdge *	goal
	)

Computes the shortest path between the start and the goal graph nodes

---

The documentation for this class was generated from the following file:

• engines/stark/movement/shortestpath.h