Merge pull request #1474 from aleksmish/patch-1

mhayter · web-flow · commit f28d1a25c4d1 · 2025-07-01T11:14:35.000-07:00
fix typo
diff --git a/src/graph/mst_prim.md b/src/graph/mst_prim.md
@@ -147,7 +147,7 @@ void prim() {
 ```
 
 The adjacency matrix `adj[][]` of size $n \times n$ stores the weights of the edges, and it uses the weight `INF` if there doesn't exist an edge between two vertices.
-The algorithm uses two arrays: the flag `selected[]`, which indicates which vertices we already have selected, and the array `min_e[]` which stores the edge with minimal weight to an selected vertex for each not-yet-selected vertex (it stores the weight and the end vertex).
+The algorithm uses two arrays: the flag `selected[]`, which indicates which vertices we already have selected, and the array `min_e[]` which stores the edge with minimal weight to a selected vertex for each not-yet-selected vertex (it stores the weight and the end vertex).
 The algorithm does $n$ steps, in each iteration the vertex with the smallest edge weight is selected, and the `min_e[]` of all other vertices gets updated.
 
 ### Sparse graphs: $O(m \log n)$
