|
bool | is_cyclic_internal (int v, std::vector< bool > &visited, std::vector< bool > &recStack) |
|
int | vertex (const std::string &node) |
|
int | size () const |
|
◆ add_edge()
void anonymous_namespace{io_modify.C}::Graph::add_edge |
( |
const std::string & | v, |
|
|
const std::string & | w ) |
◆ is_cyclic()
bool anonymous_namespace{io_modify.C}::Graph::is_cyclic |
( |
| ) |
|
◆ is_cyclic_internal()
bool anonymous_namespace{io_modify.C}::Graph::is_cyclic_internal |
( |
int | v, |
|
|
std::vector< bool > & | visited, |
|
|
std::vector< bool > & | recStack ) |
|
private |
◆ size()
int anonymous_namespace{io_modify.C}::Graph::size |
( |
| ) |
const |
|
inlineprivate |
◆ vertex()
int anonymous_namespace{io_modify.C}::Graph::vertex |
( |
const std::string & | node | ) |
|
|
private |
◆ m_adj
std::vector<Ioss::IntVector> anonymous_namespace{io_modify.C}::Graph::m_adj |
|
private |
◆ m_vertex
◆ m_vertices
std::map<std::string, int> anonymous_namespace{io_modify.C}::Graph::m_vertices |
|
private |
The documentation for this class was generated from the following file: