pathfinding

pathfinding copied to clipboard

OSM based offline routing library

1

I'm not sure this is the right repo/location for this, but here guess anyway: I'm looking for a solution for offline routing (pathfinding) library that can work on a mobile...

HarelM

Test Edmonds-Karp sparse failure

2

samueltardieu

Use boolean::then_some()

3

samueltardieu

Updates the requirements on [criterion](https://github.com/bheisler/criterion.rs) to permit the latest version. Changelog Sourced from criterion's changelog. [0.4.0] - 2022-09-10 Removed The Criterion::can_plot function has been removed. The Criterion::bench_function_over_inputs function has been...

dependabot[bot]

This issue lists Renovate updates and detected dependencies. Read the [Dependency Dashboard](https://docs.renovatebot.com/key-concepts/dashboard/) docs to learn more.[View this repository on the Mend.io Web Portal](https://developer.mend.io/github/evenfurther/pathfinding). This repository currently has no open or...

renovate[bot]

Yen's Algorithm cannot handle multiple edges

1

hello ! I noticed that the shortest path in this crate is represented using vertices `Vec`, assuming that there are no [multiple edges](en.wikipedia.org/wiki/Multiple_edges). This assumption is not an issue when...

HellOwhatAs

Hi! In this issue I want to report Profile-Guided Optimization (PGO) results on pathfinding algorithms performance. I performed some tests and want to share my results here. ## Test environment...

zamazan4ik

Generic variant of connected_components

1

samueltardieu

feat(dfs): make DFS more efficient by using IndexMap rather than Vec

1

This causes an API change as using an `IndexMap` requires the type to implement `Hash`.

samueltardieu

RFE: bidirectional search

1

https://en.wikipedia.org/wiki/Bidirectional_search It could be beneficial to some problems to search simultaneously from the start and end states to meet in the middle. The most general implementation would need to use...

cuviper