pub fn has_edge(&self, edge: &Edge) -> bool {
        let output_node_state = self.get_node_state(edge.get_output_node());
        let input_node_state = self.get_node_state(edge.get_input_node());
        if let Ok(output_node_state) = output_node_state {
            if output_node_state.edges.output_edges.contains(edge) {
                if let Ok(input_node_state) = input_node_state {
                    if input_node_state.edges.input_edges.contains(edge) {
                        return true;
                    }
                }
            }
        }

        false
    }
/// Checks whether the `edge` already exists in the graph.
Checks whether the `edge` already exists in the graph.
Checks whether the ` edge ` already exists in the graph .
pub fn has_edge(&self, edge: &Edge) -> bool {
        let output_node_state = self.get_node_state(edge.get_output_node());
        let input_node_state = self.get_node_state(edge.get_input_node());
        if let Ok(output_node_state) = output_node_state {
            if output_node_state.edges.output_edges.contains(edge) {
                if let Ok(input_node_state) = input_node_state {
                    if input_node_state.edges.input_edges.contains(edge) {
                        return true;
                    }
                }
            }
        }
        false
    }
pub fn has_edge ( & self , edge : & Edge ) -> bool { let output_node_state = self . get_node_state ( edge . get_output_node ( ) ) ; let input_node_state = self . get_node_state ( edge . get_input_node ( ) ) ; if let Ok ( output_node_state ) = output_node_state { if output_node_state . edges . output_edges . contains ( edge ) { if let Ok ( input_node_state ) = input_node_state { if input_node_state . edges . input_edges . contains ( edge ) { return true ; } } } } false }
Checks whether the `edge` already exists in the graph.
Checks whether the ` edge ` already exists in the graph .
&self
edge
&Edge
&self
edge
&Edge