pub fn new_disconnected(input_number: usize, output_number: usize) -> Self {
        let mut graph = DiGraph::new();

        for i in 0..input_number {
            graph.add_node(NodeData::new(NodeKind::Input, i));
        }

        for i in 0..output_number {
            graph.add_node(NodeData::new(NodeKind::Output, input_number + i));
        }

        graph.add_node(NodeData::new(NodeKind::Bias, input_number + output_number));

        Self {
            graph,
            input_number,
            output_number,
            toposort_cache: None,
        }
    }
// Creates a new network graph, without connections
Creates a new network graph, without connections
Creates a new network graph without connections
pub fn new_disconnected(input_number: usize, output_number: usize) -> Self {
        let mut graph = DiGraph::new();
        for i in 0..input_number {
            graph.add_node(NodeData::new(NodeKind::Input, i));
        }
        for i in 0..output_number {
            graph.add_node(NodeData::new(NodeKind::Output, input_number + i));
        }
        graph.add_node(NodeData::new(NodeKind::Bias, input_number + output_number));
        Self {
            graph,
            input_number,
            output_number,
            toposort_cache: None,
        }
    }
pub fn new_disconnected ( input_number : usize , output_number : usize ) -> Self { let mut graph = DiGraph :: new ( ) ; for i in 0 .. input_number { graph . add_node ( NodeData :: new ( NodeKind :: Input , i ) ) ; } for i in 0 .. output_number { graph . add_node ( NodeData :: new ( NodeKind :: Output , input_number + i ) ) ; } graph . add_node ( NodeData :: new ( NodeKind :: Bias , input_number + output_number ) ) ; Self { graph , input_number , output_number , toposort_cache : None , } }
Creates a new network graph, without connections
Creates a new network graph without connections
input_number
usize
output_number
usize