40#include <unordered_map>
60 template<
typename A,
typename T>
Declares class GraphIO which provides access to all graph read and write functionality.
Declaration and implementation of HashArray class.
Representation of clusters in a clustered graph.
Stores additional attributes of a clustered graph (like layout information).
Representation of clustered graphs.
Class for the representation of edges.
Stores additional attributes of a graph (like layout information).
Data type for general directed graphs (adjacency list representation).
std::unordered_map< string, node > m_nodeId
bool read(Graph &G, ClusterGraph &C, ClusterGraphAttributes &CA)
bool readNodes(Graph &G, GraphAttributes *GA, const pugi::xml_node rootTag)
bool read(Graph &G, ClusterGraph &C)
bool readData(ClusterGraphAttributes &CA, const cluster &c, const pugi::xml_node clusterData)
GraphMLParser(std::istream &in)
std::unordered_map< string, string > m_attrName
bool readAttributes(A &GA, const T &elem, const pugi::xml_node xmlElem)
pugi::xml_node m_graphTag
bool readEdges(Graph &G, GraphAttributes *GA, const pugi::xml_node rootTag)
bool read(Graph &G, GraphAttributes &GA)
bool readClusters(Graph &G, ClusterGraph &C, ClusterGraphAttributes *CA, const cluster &rootCluster, const pugi::xml_node clusterRoot)
bool readData(GraphAttributes &GA, const edge &e, const pugi::xml_node edgeData)
bool readData(GraphAttributes &GA, const node &v, const pugi::xml_node nodeData)
Class for the representation of nodes.
static MultilevelBuilder * getDoubleFactoredZeroAdjustedMerger()
The namespace for all OGDF objects.