![]() |
HAL
|
This file contains functions related to neighborhoods in graphs. More...
#include "graph_algorithm/netlist_graph.h"
#include "hal_core/defines.h"
#include "hal_core/utilities/result.h"
#include <igraph/igraph.h>
#include <set>
Go to the source code of this file.
Namespaces | |
hal | |
hal::graph_algorithm | |
Functions | |
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... | |
This file contains functions related to neighborhoods in graphs.
Definition in file neighborhood.h.