12 #ifndef CPROVER_XMLLANG_GRAPHML_H 13 #define CPROVER_XMLLANG_GRAPHML_H 45 bool has_node(
const std::string &node_name)
const 47 for(
const auto &n :
nodes)
48 if(n.node_name==node_name)
58 if(
nodes[i].node_name==node_name)
74 const std::string &filename,
80 #endif // CPROVER_XMLLANG_GRAPHML_H A generic directed graph with a parametric node type.
bool write_graphml(const graphmlt &src, std::ostream &os)
std::string invariant_scope
bool has_node(const std::string &node_name) const
graph_nodet< xml_edget >::edgest edgest
graph_nodet< xml_edget >::edget edget
nodet::node_indext node_indext
dstringt has one field, an unsigned integer no which is an index into a static table of strings...
std::map< std::string, std::string > key_valuest
A Template Class for Graphs.
bool read_graphml(std::istream &is, graphmlt &dest, graphmlt::node_indext &entry)
node_indext add_node_if_not_exists(std::string node_name)
This class represents a node in a directed graph.