Go to the source code of this file.
|
Result< std::vector< std::vector< u32 > > > | hal::graph_algorithm::get_neighborhood (NetlistGraph *graph, const std::vector< Gate * > &start_gates, u32 order, NetlistGraph::Direction direction, u32 min_dist=0) |
| Compute the neighborhood of the given order for each of the specified gates within the given netlist graph. More...
|
|
Result< std::vector< std::vector< u32 > > > | hal::graph_algorithm::get_neighborhood (NetlistGraph *graph, const std::vector< u32 > &start_vertices, u32 order, NetlistGraph::Direction direction, u32 min_dist=0) |
| Compute the neighborhood of the given order for each of the specified vertices within the given netlist graph. More...
|
|
Result< std::vector< std::vector< u32 > > > | hal::graph_algorithm::get_neighborhood_igraph (NetlistGraph *graph, const igraph_vector_int_t *start_vertices, u32 order, NetlistGraph::Direction direction, u32 min_dist=0) |
| Compute the neighborhood of the given order for each of the specified vertices within the given netlist graph. More...
|
|