From 65da6b0c55f249f8b1df32cc859f6b85f051396a Mon Sep 17 00:00:00 2001 From: bt3gl <138340846+bt3gl-cryptographer@users.noreply.github.com> Date: Tue, 8 Aug 2023 17:39:52 -0700 Subject: [PATCH] Update README.md --- graphs/README.md | 4 ++-- 1 file changed, 2 insertions(+), 2 deletions(-) diff --git a/graphs/README.md b/graphs/README.md index 364725b..e12cea3 100644 --- a/graphs/README.md +++ b/graphs/README.md @@ -17,7 +17,7 @@ * in **weighted graphs**, each edge has an associated weight. if the sum of the weights of all edges of a cycle is a negative values, it's a negative weight cycle. -* the **degree of a vertex** is the number of edges connecting the vertex. in directed, graphs, if the **in-dregree** of a vertex is `d`, there are **d** directional edges incident to the vertex (and similarly, **out-degree** from the vertex). +* the **degree of a vertex** is the number of edges connecting the vertex. in directed, graphs, if the **in-degree** of a vertex is `d`, there are **d** directional edges incident to the vertex (and similarly, **out-degree** from the vertex). * with `|V|` the number of vertices and `|E|` is the number of edges, search in a graph (either bfs of dfs) is `O(|V| + |E|)`. @@ -221,7 +221,7 @@ def iterative_dfs(graph, v, discovered): * 0 A gate. * `INF` Infinity means an empty room (`2^31 - 1 = 2147483647` to represent `INF`) -* fill empty room with the distance to its nearest gate. if it is impossible to reach a gate, it should be filled with `INF`. +* fill the empty room with the distance to its nearest gate. if it is impossible to reach a gate, it should be filled with `INF`.