Skip to content

Commit 3ffba21

Browse files
Bump serde_json from 1.0.120 to 1.0.121 (#1258)
* Fix clippy warnings after 1.80 release * Bump serde_json from 1.0.120 to 1.0.121 Bumps [serde_json](https://github.com/serde-rs/json) from 1.0.120 to 1.0.121. - [Release notes](https://github.com/serde-rs/json/releases) - [Commits](serde-rs/json@v1.0.120...v1.0.121) --- updated-dependencies: - dependency-name: serde_json dependency-type: direct:production update-type: version-update:semver-patch ... Signed-off-by: dependabot[bot] <[email protected]> --------- Signed-off-by: dependabot[bot] <[email protected]> Co-authored-by: Ivan Carvalho <[email protected]> Co-authored-by: dependabot[bot] <49699333+dependabot[bot]@users.noreply.github.com>
1 parent 8b5d38b commit 3ffba21

File tree

3 files changed

+6
-5
lines changed

3 files changed

+6
-5
lines changed

Cargo.lock

Lines changed: 3 additions & 2 deletions
Some generated files are not rendered by default. Learn more about customizing how changed files appear on GitHub.

rustworkx-core/src/dag_algo.rs

Lines changed: 2 additions & 2 deletions
Original file line numberDiff line numberDiff line change
@@ -249,8 +249,8 @@ type LongestPathResult<G, T, E> = Result<Option<(Vec<NodeId<G>>, T)>, E>;
249249
/// # Arguments
250250
/// * `graph`: Reference to a directed graph.
251251
/// * `weight_fn` - An input callable that will be passed the `EdgeRef` for each edge in the graph.
252-
/// The callable should return the weight of the edge as `Result<T, E>`. The weight must be a type that implements
253-
/// `Num`, `Zero`, `PartialOrd`, and `Copy`.
252+
/// The callable should return the weight of the edge as `Result<T, E>`. The weight must be a type that implements
253+
/// `Num`, `Zero`, `PartialOrd`, and `Copy`.
254254
///
255255
/// # Type Parameters
256256
/// * `G`: Type of the graph. Must be a directed graph.

rustworkx-core/src/steiner_tree.rs

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -303,7 +303,7 @@ where
303303
/// - there is an edge `(u, v)` in the graph and path pass through this edge.
304304
/// - node `s` is the closest node to `u` among all `terminal_nodes`
305305
/// - node `t` is the closest node to `v` among all `terminal_nodes`
306-
/// and wraps the result inside a `MetricClosureEdge`
306+
/// and wraps the result inside a `MetricClosureEdge`
307307
///
308308
/// For example, if all vertices are terminals, it returns the original edges of the graph.
309309
fn fast_metric_edges<G, F, E>(

0 commit comments

Comments
 (0)