From 003d78e422bf850e7de0d90fefcd27d15fc7edb7 Mon Sep 17 00:00:00 2001
From: jujube <50985954+jujube@users.noreply.github.com>
Date: Mon, 8 Apr 2024 18:17:06 +0800
Subject: [PATCH] style: code readability (#5373)

Co-authored-by: orizi <104711814+orizi@users.noreply.github.com>
---
 crates/cairo-lang-utils/src/graph_algos/scc_graph_node.rs | 6 +++---
 1 file changed, 3 insertions(+), 3 deletions(-)

diff --git a/crates/cairo-lang-utils/src/graph_algos/scc_graph_node.rs b/crates/cairo-lang-utils/src/graph_algos/scc_graph_node.rs
index bdf8c95d4c4..28660ea3337 100644
--- a/crates/cairo-lang-utils/src/graph_algos/scc_graph_node.rs
+++ b/crates/cairo-lang-utils/src/graph_algos/scc_graph_node.rs
@@ -7,8 +7,8 @@ use super::strongly_connected_components::ComputeScc;
 /// A node whose neighbors are only the subset of its neighbors in the full graph, which are also in
 /// the same SCC (strongly-connected-component) with it.
 #[derive(Clone)]
-pub struct SccGraphNode<Node: GraphNode>(Node);
-impl<Node: GraphNode + ComputeScc> GraphNode for SccGraphNode<Node> {
+pub struct SccGraphNode<Node: ComputeScc>(Node);
+impl<Node: ComputeScc> GraphNode for SccGraphNode<Node> {
     type NodeId = Node::NodeId;
 
     fn get_neighbors(&self) -> Vec<Self> {
@@ -20,7 +20,7 @@ impl<Node: GraphNode + ComputeScc> GraphNode for SccGraphNode<Node> {
         self.0.get_id()
     }
 }
-impl<Node: GraphNode> From<Node> for SccGraphNode<Node> {
+impl<Node: ComputeScc> From<Node> for SccGraphNode<Node> {
     fn from(value: Node) -> Self {
         SccGraphNode::<Node>(value)
     }