add_edges(const std::vector< std::pair< Gate *, Gate * >> &edges) | hal::graph_algorithm::NetlistGraph | |
add_edges(const std::vector< std::pair< u32, u32 >> &edges) | hal::graph_algorithm::NetlistGraph | |
add_edges(const std::map< Gate *, std::set< Gate * >> &edges) | hal::graph_algorithm::NetlistGraph | |
copy() const | hal::graph_algorithm::NetlistGraph | |
delete_edges(const std::vector< std::pair< Gate *, Gate * >> &edges) | hal::graph_algorithm::NetlistGraph | |
delete_edges(const std::vector< std::pair< u32, u32 >> &edges) | hal::graph_algorithm::NetlistGraph | |
Direction enum name | hal::graph_algorithm::NetlistGraph | |
from_netlist(Netlist *nl, bool create_dummy_vertices=false, const std::function< bool(const Net *)> &filter=nullptr) | hal::graph_algorithm::NetlistGraph | static |
from_netlist_no_edges(Netlist *nl, const std::vector< Gate * > &gates={}) | hal::graph_algorithm::NetlistGraph | static |
get_edges() const | hal::graph_algorithm::NetlistGraph | |
get_edges_in_netlist() const | hal::graph_algorithm::NetlistGraph | |
get_gate_from_vertex(const u32 vertex) const | hal::graph_algorithm::NetlistGraph | |
get_gates_from_vertices(const std::vector< u32 > &vertices) const | hal::graph_algorithm::NetlistGraph | |
get_gates_from_vertices(const std::set< u32 > &vertices) const | hal::graph_algorithm::NetlistGraph | |
get_gates_from_vertices_igraph(const igraph_vector_int_t *vertices) const | hal::graph_algorithm::NetlistGraph | |
get_gates_set_from_vertices(const std::vector< u32 > &vertices) const | hal::graph_algorithm::NetlistGraph | |
get_gates_set_from_vertices(const std::set< u32 > &vertices) const | hal::graph_algorithm::NetlistGraph | |
get_gates_set_from_vertices_igraph(const igraph_vector_int_t *vertices) const | hal::graph_algorithm::NetlistGraph | |
get_graph() const | hal::graph_algorithm::NetlistGraph | |
get_netlist() const | hal::graph_algorithm::NetlistGraph | |
get_num_edges() const | hal::graph_algorithm::NetlistGraph | |
get_num_vertices(bool only_connected=false) const | hal::graph_algorithm::NetlistGraph | |
get_vertex_from_gate(Gate *g) const | hal::graph_algorithm::NetlistGraph | |
get_vertices(bool only_connected=false) const | hal::graph_algorithm::NetlistGraph | |
get_vertices_from_gates(const std::vector< Gate * > &gates) const | hal::graph_algorithm::NetlistGraph | |
get_vertices_from_gates(const std::set< Gate * > &gates) const | hal::graph_algorithm::NetlistGraph | |
get_vertices_from_gates_igraph(const std::vector< Gate * > &gates) const | hal::graph_algorithm::NetlistGraph | |
get_vertices_from_gates_igraph(const std::set< Gate * > &gates) const | hal::graph_algorithm::NetlistGraph | |
NetlistGraph(Netlist *nl, igraph_t &&graph, std::unordered_map< u32, Gate * > &&nodes_to_gates) | hal::graph_algorithm::NetlistGraph | |
print() const | hal::graph_algorithm::NetlistGraph | |
~NetlistGraph() | hal::graph_algorithm::NetlistGraph | |