|
HAL
v4.5.0-83-g30c8f0afc
The Hardware Analyzer - a comprehensive reverse engineering and manipulation framework for gate-level netlists.
|
#include "graph_algorithm/algorithms/subgraph.h"#include "graph_algorithm/netlist_graph.h"#include "hal_core/netlist/gate.h"
Go to the source code of this file.
Namespaces | |
| hal | |
| hal::graph_algorithm | |
Functions | |
| 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... | |