epitaph_graphs/path_finding/dijkstra library
Classes
- Dijkstra
- A class with the tools needed to solve a shortest path problem with the Dijkstra algorithm.
- epitaph_ips package
- documentation
- epitaph_graphs/path_finding/dijkstra.dart
epitaph_ips package
- Libraries
- epitaph_ips/buildings/area
- epitaph_ips/positioning_system/beacon
- epitaph_ips/buildings/building
- epitaph_ips/tracking/calculator
- epitaph_ips/buildings/circular_area
- epitaph_graphs/path_finding/dijkstra
- epitaph_graphs/nodes/directed_edge
- epitaph_graphs/graphs/directed_graph
- epitaph_graphs/nodes/edge
- epitaph_graphs/nodes/epitaph_edge
- epitaph_graphs/graphs/epitaph_graph
- epitaph_ips
- epitaph_graphs/nodes/epitaph_vertex
- epitaph_ips/tracking/filter
- epitaph_ips/buildings/floor
- epitaph_graphs/graphs/graph
- epitaph_ips/buildings/landmark
- epitaph_ips/tracking/lma
- epitaph_ips/tracking/lma_function
- epitaph_ips/tracking/mapper
- epitaph_ips/tracking/matrix_helpers
- epitaph_ips/tracking/merwe_function
- epitaph_ips/positioning_system/mock_beacon
- epitaph_ips/tracking/multilateration_function
- epitaph_graphs/path_finding/path
- epitaph_ips/buildings/point
- epitaph_ips/buildings/polygonal_area
- epitaph_ips/positioning_system/real_beacon
- epitaph_ips/buildings/room
- epitaph_ips/tracking/sigma_point_function
- epitaph_graphs/nodes/simple_directed_edge
- epitaph_ips/tracking/simple_ukf
- epitaph_graphs/nodes/simple_undirected_edge
- epitaph_graphs/nodes/simple_vertex
- epitaph_ips/tracking/tracker
- epitaph_graphs/nodes/undirected_edge
- epitaph_graphs/graphs/undirected_graph
- epitaph_ips/positioning_system/user
- epitaph_graphs/nodes/vertex
- epitaph_ips/buildings/world_location