|
| procedure_local_cfg_baset () |
|
void | operator() (const method_with_amapt &args) |
|
unsigned | get_first_node (const method_with_amapt &args) const |
|
unsigned | get_last_node (const method_with_amapt &args) const |
|
unsigned | nodes_empty (const method_with_amapt &args) const |
|
node_indext | add_node () |
|
void | swap (grapht &other) |
|
bool | has_edge (node_indext i, node_indext j) const |
|
const nodet & | operator[] (node_indext n) const |
|
nodet & | operator[] (node_indext n) |
|
void | resize (node_indext s) |
|
std::size_t | size () const |
|
bool | empty () const |
|
const edgest & | in (node_indext n) const |
|
const edgest & | out (node_indext n) const |
|
void | add_edge (node_indext a, node_indext b) |
|
void | remove_edge (node_indext a, node_indext b) |
|
edget & | edge (node_indext a, node_indext b) |
|
void | add_undirected_edge (node_indext a, node_indext b) |
|
void | remove_undirected_edge (node_indext a, node_indext b) |
|
void | remove_in_edges (node_indext n) |
|
void | remove_out_edges (node_indext n) |
|
void | remove_edges (node_indext n) |
|
void | clear () |
|
void | shortest_path (node_indext src, node_indext dest, patht &path) const |
|
void | shortest_loop (node_indext node, patht &path) const |
|
void | visit_reachable (node_indext src) |
|
void | make_chordal () |
|
std::size_t | connected_subgraphs (std::vector< node_indext > &subgraph_nr) |
|
std::size_t | SCCs (std::vector< node_indext > &subgraph_nr) |
|
bool | is_dag () const |
|
std::list< node_indext > | topsort () const |
| Find a topological order of the nodes if graph is DAG, return empty list for non-DAG or empty graph. More...
|
|
void | output_dot (std::ostream &out) const |
|
void | output_dot_node (std::ostream &out, node_indext n) const |
|
template<class T>
struct procedure_local_cfg_baset< T, java_bytecode_convert_methodt::method_with_amapt, unsigned >
Definition at line 27 of file java_local_variable_table.cpp.