pub fn print(&self)
    {
        println!("\nLogical Dataflow");
        println!("================");
        println!("\nOperators:");
        for n in self.logical_graph.raw_nodes()
        {
            println!("{:?}",n);
        }
        println!("\nChannels:");
        for e in self.logical_graph.raw_edges()
        {
            println!("{:?},{:?}",self.logical_graph.node_weight(e.source()),self.logical_graph.node_weight(e.target()));
        }
    }
/// Prints the topology to standard output
Prints the topology to standard output
Prints the topology to standard output
pub fn print(&self)
    {
        println!("\nLogical Dataflow");
        println!("================");
        println!("\nOperators:");
        for n in self.logical_graph.raw_nodes()
        {
            println!("{:?}",n);
        }
        println!("\nChannels:");
        for e in self.logical_graph.raw_edges()
        {
            println!("{:?},{:?}",self.logical_graph.node_weight(e.source()),self.logical_graph.node_weight(e.target()));
        }
    }
pub fn print ( & self ) { println ! ( " \n " ) ; println ! ( " " ) ; println ! ( " \n " ) ; for n in self . logical_graph . raw_nodes ( ) { println ! ( " " n ) ; } println ! ( " \n " ) ; for e in self . logical_graph . raw_edges ( ) { println ! ( " " self logical_graph node_weight ( e source ( ) ) self logical_graph node_weight ( e target ( ) ) ) ; } }
Prints the topology to standard output
Prints the topology to standard output
&self
&self