 |
Open Graph Drawing Framework |
v. 2022.02 (Dogwood)
|
|
|
Go to the documentation of this file.
40 #include <unordered_map>
57 std::unordered_map<std::string, node>
m_nodeId;
79 explicit Parser(std::istream &is);
bool readAttributes(GraphAttributes &GA, node v, const pugi::xml_node nodeTag)
The namespace for all OGDF objects.
Stores additional attributes of a graph (like layout information).
Declaration of class GraphAttributes which extends a Graph by additional attributes.
Includes declaration of graph class.
pugi::xml_node m_graphTag
std::unordered_map< std::string, node > m_nodeId
bool readCluster(Graph &G, ClusterGraph &C, ClusterGraphAttributes *CA, cluster rootCluster, const pugi::xml_node rootTag)
std::unordered_map< std::string, std::string > m_nodeAttr
bool readNodes(Graph &G, GraphAttributes *GA)
Representation of clusters in a clustered graph.
Stores additional attributes of a clustered graph (like layout information).
pugi::xml_node m_edgesTag
std::unordered_map< std::string, std::string > m_edgeAttr
Data type for general directed graphs (adjacency list representation).
std::unordered_map< std::string, cluster > m_clusterId
bool readEdges(Graph &G, ClusterGraph *C, GraphAttributes *GA)
static void error(const pugi::xml_node tag, const std::string &msg)
pugi::xml_node m_nodesTag
Declares ClusterGraphAttributes, an extension of class GraphAttributes, to store clustergraph layout ...
Class for the representation of edges.
Derived class of GraphObserver providing additional functionality to handle clustered graphs.
Representation of clustered graphs.
Class for the representation of nodes.