Matt Corallo a3f7b790b4 Drop A* implementation in the router for simple Dijkstra's ... As evidenced by the previous commit, it appears our A* router does worse than a more naive approach. This isn't super surpsising, as the A* heuristic calculation requires a map lookup, which is relatively expensive. ``` test routing::router::benches::generate_mpp_routes_with_probabilistic_scorer ... bench: 169,991,943 ns/iter (+/- 30,838,048) test routing::router::benches::generate_mpp_routes_with_zero_penalty_scorer ... bench: 122,144,987 ns/iter (+/- 61,708,911) test routing::router::benches::generate_routes_with_probabilistic_scorer ... bench: 48,546,068 ns/iter (+/- 10,379,642) test routing::router::benches::generate_routes_with_zero_penalty_scorer ... bench: 32,898,557 ns/iter (+/- 14,157,641) ```		2023-01-25 17:17:55 +00:00
..
src	Drop A* implementation in the router for simple Dijkstra's	2023-01-25 17:17:55 +00:00
Cargo.toml	Bump crate versions to 0.0.113/invoice 0.21	2022-12-15 22:15:55 +00:00