AStar-JPS-ThetaStar

Basic algorithms for single-shot grid-based path finding: BFS, Dijkstra, A*, Jump Point Search (JPS), Theta*

Name		Name	Last commit message	Last commit date
Latest commit History 2 Commits
ASearch.pro		ASearch.pro
README.md		README.md
asearch.cpp		asearch.cpp
astar.cpp		astar.cpp
astar.h		astar.h
bfs.cpp		bfs.cpp
bfs.h		bfs.h
config.cpp		config.cpp
config.h		config.h
dijkstra.cpp		dijkstra.cpp
dijkstra.h		dijkstra.h
environmentoptions.cpp		environmentoptions.cpp
environmentoptions.h		environmentoptions.h
gl_const.h		gl_const.h
ilogger.h		ilogger.h
isearch.cpp		isearch.cpp
isearch.h		isearch.h
jp_search.cpp		jp_search.cpp
jp_search.h		jp_search.h
list.cpp		list.cpp
list.h		list.h
map.cpp		map.cpp
map.h		map.h
mission.cpp		mission.cpp
mission.h		mission.h
node.h		node.h
searchresult.h		searchresult.h
theta.cpp		theta.cpp
theta.h		theta.h
tinystr.cpp		tinystr.cpp
tinystr.h		tinystr.h
tinyxml.cpp		tinyxml.cpp
tinyxml.h		tinyxml.h
tinyxmlerror.cpp		tinyxmlerror.cpp
tinyxmlparser.cpp		tinyxmlparser.cpp
xmllogger.cpp		xmllogger.cpp
xmllogger.h		xmllogger.h

Provide feedback