56 using Iterator = std::vector<Token>::const_iterator;
71 std::string& nodeDefault,
EdgeArray<bool>& edgeDone, std::string& edgeDefault);
76 inline void tokenError(
const char* str,
bool got =
true);
77 inline void tokenError(
const std::string& str,
bool got =
true);
Derived class of GraphObserver providing additional functionality to handle clustered graphs.
Declares ClusterGraphAttributes, an extension of class GraphAttributes, to store clustergraph layout ...
Includes declaration of graph class.
Declares a TLP file format lexer class and related structures.
Representation of clusters in a clustered graph.
Stores additional attributes of a clustered graph (like layout information).
Representation of clustered graphs.
Stores additional attributes of a graph (like layout information).
Data type for general directed graphs (adjacency list representation).
RegisteredArray for edges of a graph, specialized for EdgeArray<edge>.
RegisteredArray for nodes, edges and adjEntries of a graph.
std::map< int, node > m_idNode
std::vector< Token >::const_iterator Iterator
bool readProperty(Graph &G, GraphAttributes *GA)
void tokenError(const std::string &str, bool got=true)
bool readCluster(Graph &G, ClusterGraph *C, cluster c)
bool readStatement(Graph &G, GraphAttributes *GA, ClusterGraph *C)
bool readPropertyStatement(GraphAttributes *GA, const Attribute &attr, NodeArray< bool > &nodeDone, std::string &nodeDefault, EdgeArray< bool > &edgeDone, std::string &edgeDefault)
void tokenError(const char *str, bool got=true)
std::map< int, edge > m_idEdge
bool read(Graph &G, ClusterGraph &C, ClusterGraphAttributes &CA)
bool readNodes(Graph &G, ClusterGraph *C, cluster c)
bool readClusterStatement(Graph &G, ClusterGraph *C, cluster c)
bool applyNodes(Graph &G, ClusterGraph *C, cluster c, const std::string &str)
bool readGraph(Graph &G, GraphAttributes *GA, ClusterGraph *C)
bool read(Graph &G, ClusterGraph &C)
bool read(Graph &G, GraphAttributes &GA)
The namespace for all OGDF objects.