pub(crate) fn circuit_graph<P>(circuit: &Circuit<P>) -> DiGraphMap<NodeId, ()> {
        let mut g = DiGraphMap::<NodeId, ()>::new();

        for node_id in circuit.node_ids().into_iter() {
            g.add_node(node_id);
        }

        for edge in circuit.edges().deref().iter() {
            g.add_edge(edge.from, edge.to, ());
        }

        g
    }
/// Dump circuit topology as a graph.
Dump circuit topology as a graph.
Dump circuit topology as a graph .
pub(crate) fn circuit_graph<P>(circuit: &Circuit<P>) -> DiGraphMap<NodeId, ()> {
        let mut g = DiGraphMap::<NodeId, ()>::new();
        for node_id in circuit.node_ids().into_iter() {
            g.add_node(node_id);
        }
        for edge in circuit.edges().deref().iter() {
            g.add_edge(edge.from, edge.to, ());
        }
        g
    }
pub ( crate ) fn circuit_graph < P > ( circuit : & Circuit < P > ) -> DiGraphMap < NodeId , ( ) > { let mut g = DiGraphMap :: < NodeId , ( ) > :: new ( ) ; for node_id in circuit . node_ids ( ) . into_iter ( ) { g . add_node ( node_id ) ; } for edge in circuit . edges ( ) . deref ( ) . iter ( ) { g . add_edge ( edge . from , edge . to , ( ) ) ; } g }
Dump circuit topology as a graph.
Dump circuit topology as a graph .
circuit
&Circuit<P>