Go to the source code of this file.
|
Result< std::unique_ptr< NetlistGraph > > | hal::graph_algorithm::get_subgraph (const NetlistGraph *graph, const std::vector< Gate * > &subgraph_gates) |
| Compute the subgraph induced by the specified gates, including all edges between the corresponding vertices. More...
|
|
Result< std::unique_ptr< NetlistGraph > > | hal::graph_algorithm::get_subgraph (const NetlistGraph *graph, const std::set< Gate * > &subgraph_gates) |
| Compute the subgraph induced by the specified gates, including all edges between the corresponding vertices. More...
|
|
Result< std::unique_ptr< NetlistGraph > > | hal::graph_algorithm::get_subgraph (const NetlistGraph *graph, const std::vector< u32 > &subgraph_vertices) |
| Compute the subgraph induced by the specified vertices, including all edges between these vertices. More...
|
|
Result< std::unique_ptr< NetlistGraph > > | hal::graph_algorithm::get_subgraph (const NetlistGraph *graph, const std::set< u32 > &subgraph_vertices) |
| Compute the subgraph induced by the specified vertices, including all edges between these vertices. More...
|
|
Result< std::unique_ptr< NetlistGraph > > | hal::graph_algorithm::get_subgraph_igraph (const NetlistGraph *graph, const igraph_vector_int_t *subgraph_vertices) |
| Compute the subgraph induced by the specified vertices, including all edges between these vertices. More...
|
|