From b622a1b0a97df7773df0ad090d81c960d797d59b Mon Sep 17 00:00:00 2001
From: TonalidadeHidrica <47710717+TonalidadeHidrica@users.noreply.github.com>
Date: Sun, 26 Mar 2023 22:16:45 +0200
Subject: [PATCH] Apply suggestions from code review

Co-authored-by: Hiroki Kobayashi <3303362+koba-e964@users.noreply.github.com>
---
 src/scc.rs | 4 ++--
 1 file changed, 2 insertions(+), 2 deletions(-)

diff --git a/src/scc.rs b/src/scc.rs
index dc63cee..f223ff4 100644
--- a/src/scc.rs
+++ b/src/scc.rs
@@ -2,7 +2,7 @@
 
 use crate::internal_scc;
 
-/// A `SccGraph` is a directed graph that calculates strongly connected components (SCC) in $O(|V| + |E|)$.
+/// An `SccGraph` is a directed graph that calculates strongly connected components (SCC) in $O(|V| + |E|)$.
 ///
 /// # Example
 ///
@@ -78,7 +78,7 @@ impl SccGraph {
     ///
     /// - Each vertex is in exactly one "list of the vertices".
     /// - Each "list of the vertices" corresponds to the vertex set of a strongly connected component. The order of the vertices in the list is undefined.
-    /// - The list of "list of the vertices" are sorted in topological order, i.e., for two vertices $u$, $v$ in different strongly connected components, if there is a directed path from $u$ to $v$, the list contains $u$ appears earlier than the list contains $v$.
+    /// - The list of "list of the vertices" are sorted in topological order, i.e., for two vertices $u$, $v$ in different strongly connected components, if there is a directed path from $u$ to $v$, the list containing $u$ appears earlier than the list containing $v$.
     ///
     /// # Complexity
     ///