Dijkstra Class Reference

#include <dijkstra.h>

Collaboration diagram for Dijkstra:

Classes
struct	H3IndexHash
struct	Node

Public Member Functions
std::vector< H3Index >	findShortestPath (H3Index start, H3Index end)

Static Private Member Functions
static std::vector< H3Index >	getNeighbors (H3Index cell)
static double	getDistanceBetweenCells (H3Index cell1, H3Index cell2)
static std::vector< H3Index >	reconstructPath (const std::unordered_map< H3Index, H3Index, H3IndexHash > &previous, H3Index start, H3Index end)

Detailed Description

Definition at line 4 of file dijkstra.h.

Member Function Documentation

findShortestPath()

std::vector< H3Index > Dijkstra::findShortestPath	(	H3Index	start,
		H3Index	end
	)

Definition at line 5 of file dijkstra.cpp.

References getDistanceBetweenCells(), getNeighbors(), and reconstructPath().

Here is the call graph for this function:

getDistanceBetweenCells()

double Dijkstra::getDistanceBetweenCells ( H3Index  cell1, H3Index  cell2  )

staticprivate

Definition at line 104 of file dijkstra.cpp.

Referenced by findShortestPath().

Here is the caller graph for this function:

getNeighbors()

std::vector< H3Index > Dijkstra::getNeighbors ( H3Index  cell )

staticprivate

Definition at line 79 of file dijkstra.cpp.

Referenced by findShortestPath().

Here is the caller graph for this function:

reconstructPath()

std::vector< H3Index > Dijkstra::reconstructPath ( const std::unordered_map< H3Index, H3Index, H3IndexHash > &  previous, H3Index  start, H3Index  end  )

staticprivate

Definition at line 118 of file dijkstra.cpp.

Referenced by findShortestPath().

Here is the caller graph for this function:

---

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

• src/models/dijkstra.h
• src/models/dijkstra.cpp