Egor Starovoitov
Egor Starovoitov
Two algorithms are implemented: for finding [bridges](https://www.geeksforgeeks.org/bridge-in-a-graph/) and for finding [points of articulation](https://www.geeksforgeeks.org/articulation-points-or-cut-vertices-in-a-graph/) are implemented, each of which expects the argument to be a simple undirected graph. The algorithms are...
### Summary This is the algorithm for solving the all-pairs-shortest-path problem for undirected, unweighted, connected graphs. ### Motivation I have just conducted a performance test in which a function using...
It would be nice to implement code generation for the `char` type, and I'm surprised why it's still absent. In my project, I use a structure from an external crate...
I also tested the changes with the following code: ```rust #[cfg(test)] mod test { use super::*; use std::path::PathBuf; #[test] fn test_replace_path_buf() { let engine = Engine::new(); let mut scope =...
Why is the file path passed to `Engine::eval_file_with_scope` as `PathBuf `instead of `Path`? I'm a little surprised by this decision, because it can provoke an extra allocation.
One of the significant changes is the use of the [SPFA implementation](https://github.com/petgraph/petgraph/pull/686) from `petgraph` instead of similar old one.
1. Avoid `.unwrap()`. Where `.unwrap()` appears as a result of comparing distances, it may be necessary to impose additional restrictions on the types used. 2. Add `MetricCalculator` type with methods...
Currently, `shortest_distances` uses `f32` to represent lengths. It is worth giving the user the opportunity to select the type of result. This task should be coordinated with #7 Perhaps it...
- [ ] Add benchmarks - [ ] Rewrite `find_parents` without recursion. #### Changes below will be implemented in `0.4.0` or later, when the [`Tree`](https://github.com/petgraph/petgraph/issues/711) type is included in `petgraph`...