add_edge(node_indext a, node_indext b) | grapht< cfg_base_nodet< T, goto_programt::const_targett > > | inline |
add_node(arguments &&... values) | grapht< cfg_base_nodet< T, goto_programt::const_targett > > | inline |
add_undirected_edge(node_indext a, node_indext b) | grapht< cfg_base_nodet< T, goto_programt::const_targett > > | |
base_grapht typedef | cfg_baset< T, P, I > | private |
cfg_baset() | cfg_baset< T, P, I > | inline |
clear() | grapht< cfg_base_nodet< T, goto_programt::const_targett > > | inline |
compute_edges(const goto_functionst &goto_functions, const goto_programt &goto_program, I PC) | cfg_baset< T, P, I > | protected |
compute_edges(const goto_functionst &goto_functions, P &goto_program) | cfg_baset< T, P, I > | protected |
compute_edges(const goto_functionst &goto_functions) | cfg_baset< T, P, I > | protected |
compute_edges_catch(const goto_programt &goto_program, const goto_programt::instructiont &instruction, goto_programt::const_targett next_PC, entryt &entry) | cfg_baset< T, P, I > | protectedvirtual |
compute_edges_function_call(const goto_functionst &goto_functions, const goto_programt &goto_program, const goto_programt::instructiont &instruction, goto_programt::const_targett next_PC, entryt &entry) | cfg_baset< T, P, I > | protectedvirtual |
compute_edges_goto(const goto_programt &goto_program, const goto_programt::instructiont &instruction, goto_programt::const_targett next_PC, entryt &entry) | cfg_baset< T, P, I > | protectedvirtual |
compute_edges_start_thread(const goto_programt &goto_program, const goto_programt::instructiont &instruction, goto_programt::const_targett next_PC, entryt &entry) | cfg_baset< T, P, I > | protectedvirtual |
compute_edges_throw(const goto_programt &goto_program, const goto_programt::instructiont &instruction, goto_programt::const_targett next_PC, entryt &entry) | cfg_baset< T, P, I > | protectedvirtual |
connected_subgraphs(std::vector< node_indext > &subgraph_nr) | grapht< cfg_base_nodet< T, goto_programt::const_targett > > | |
depth_limited_search(typename N::node_indext src, std::size_t limit) const | grapht< cfg_base_nodet< T, goto_programt::const_targett > > | |
depth_limited_search(std::vector< typename N::node_indext > &src, std::size_t limit) const | grapht< cfg_base_nodet< T, goto_programt::const_targett > > | |
depth_limited_search(std::vector< typename N::node_indext > &src, std::size_t limit, std::vector< bool > &visited) const | grapht< cfg_base_nodet< T, goto_programt::const_targett > > | protected |
disconnect_unreachable(node_indext src) | grapht< cfg_base_nodet< T, goto_programt::const_targett > > | |
disconnect_unreachable(const std::vector< node_indext > &src) | grapht< cfg_base_nodet< T, goto_programt::const_targett > > | |
edge(node_indext a, node_indext b) | grapht< cfg_base_nodet< T, goto_programt::const_targett > > | inline |
edgest typedef | grapht< cfg_base_nodet< T, goto_programt::const_targett > > | |
edget typedef | grapht< cfg_base_nodet< T, goto_programt::const_targett > > | |
empty() const | grapht< cfg_base_nodet< T, goto_programt::const_targett > > | inline |
entries() const | cfg_baset< T, P, I > | inline |
entry_map | cfg_baset< T, P, I > | |
entryt typedef | cfg_baset< T, P, I > | |
for_each_predecessor(const node_indext &n, std::function< void(const node_indext &)> f) const | grapht< cfg_base_nodet< T, goto_programt::const_targett > > | |
for_each_successor(const node_indext &n, std::function< void(const node_indext &)> f) const | grapht< cfg_base_nodet< T, goto_programt::const_targett > > | |
get_first_node(P &program) | cfg_baset< T, P, I > | inlinestatic |
get_last_node(P &program) | cfg_baset< T, P, I > | inlinestatic |
get_node(const goto_programt::const_targett &program_point) | cfg_baset< T, P, I > | inline |
get_node(const goto_programt::const_targett &program_point) const | cfg_baset< T, P, I > | inline |
get_node_index(const goto_programt::const_targett &program_point) const | cfg_baset< T, P, I > | inline |
get_predecessors(const node_indext &n) const | grapht< cfg_base_nodet< T, goto_programt::const_targett > > | |
get_reachable(node_indext src, bool forwards) const | grapht< cfg_base_nodet< T, goto_programt::const_targett > > | |
get_reachable(const std::vector< node_indext > &src, bool forwards) const | grapht< cfg_base_nodet< T, goto_programt::const_targett > > | |
get_successors(const node_indext &n) const | grapht< cfg_base_nodet< T, goto_programt::const_targett > > | |
has_edge(node_indext i, node_indext j) const | grapht< cfg_base_nodet< T, goto_programt::const_targett > > | inline |
in(node_indext n) const | grapht< cfg_base_nodet< T, goto_programt::const_targett > > | inline |
is_dag() const | grapht< cfg_base_nodet< T, goto_programt::const_targett > > | inline |
make_chordal() | grapht< cfg_base_nodet< T, goto_programt::const_targett > > | |
node_indext typedef | grapht< cfg_base_nodet< T, goto_programt::const_targett > > | |
nodes | grapht< cfg_base_nodet< T, goto_programt::const_targett > > | protected |
nodes_empty(P &program) | cfg_baset< T, P, I > | inlinestatic |
nodest typedef | grapht< cfg_base_nodet< T, goto_programt::const_targett > > | |
nodet typedef | cfg_baset< T, P, I > | |
operator()(const goto_functionst &goto_functions) | cfg_baset< T, P, I > | inline |
operator()(P &goto_program) | cfg_baset< T, P, I > | inline |
operator[](node_indext n) const | grapht< cfg_base_nodet< T, goto_programt::const_targett > > | inline |
operator[](node_indext n) | grapht< cfg_base_nodet< T, goto_programt::const_targett > > | inline |
out(node_indext n) const | grapht< cfg_base_nodet< T, goto_programt::const_targett > > | inline |
output_dot(std::ostream &out) const | grapht< cfg_base_nodet< T, goto_programt::const_targett > > | |
patht typedef | grapht< cfg_base_nodet< T, goto_programt::const_targett > > | |
remove_edge(node_indext a, node_indext b) | grapht< cfg_base_nodet< T, goto_programt::const_targett > > | inline |
remove_edges(node_indext n) | grapht< cfg_base_nodet< T, goto_programt::const_targett > > | inline |
remove_in_edges(node_indext n) | grapht< cfg_base_nodet< T, goto_programt::const_targett > > | |
remove_out_edges(node_indext n) | grapht< cfg_base_nodet< T, goto_programt::const_targett > > | |
remove_undirected_edge(node_indext a, node_indext b) | grapht< cfg_base_nodet< T, goto_programt::const_targett > > | |
resize(node_indext s) | grapht< cfg_base_nodet< T, goto_programt::const_targett > > | inline |
SCCs(std::vector< node_indext > &subgraph_nr) const | grapht< cfg_base_nodet< T, goto_programt::const_targett > > | |
shortest_loop(node_indext node, patht &path) const | grapht< cfg_base_nodet< T, goto_programt::const_targett > > | inline |
shortest_path(node_indext src, node_indext dest, patht &path) const | grapht< cfg_base_nodet< T, goto_programt::const_targett > > | inline |
shortest_path(node_indext src, node_indext dest, patht &path, bool non_trivial) const | grapht< cfg_base_nodet< T, goto_programt::const_targett > > | protected |
size() const | grapht< cfg_base_nodet< T, goto_programt::const_targett > > | inline |
swap(grapht &other) | grapht< cfg_base_nodet< T, goto_programt::const_targett > > | inline |
tarjan(class tarjant &t, node_indext v) const | grapht< cfg_base_nodet< T, goto_programt::const_targett > > | protected |
topsort() const | grapht< cfg_base_nodet< T, goto_programt::const_targett > > | |
visit_reachable(node_indext src) | grapht< cfg_base_nodet< T, goto_programt::const_targett > > | |
~cfg_baset() | cfg_baset< T, P, I > | inlinevirtual |