style: code readability (starkware-libs#5373)

Co-authored-by: orizi <[email protected]>

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)
     }