45class ClusterGraphAttributes;
 
  177        Graph(
const bool& paramStrict, 
const bool& dir, std::string* idString,
 
 
  227        AsgnStmt(
const std::string& lhsString, 
const std::string& rhsString);
 
 
  266        const std::string 
id;
 
 
 
  356            const std::string& 
id);
 
 
  374            std::vector<Ast::AttrList*>& edgeDefaultsVector, std::set<node>& nodeSet);
 
  382            std::vector<Ast::AttrList*>& newEdgeDefaults) 
const;
 
 
Derived class of GraphObserver providing additional functionality to handle clustered graphs.
 
Declares stuff related to DOT format lexical analysis.
 
Includes declaration of graph class.
 
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.
 
Stores additional attributes of a graph (like layout information).
 
Data type for general directed graphs (adjacency list representation).
 
Indexed arrays using hashing for element access.
 
Class for the representation of nodes.
 
DOT format abstract syntax tree class, based on official documentation.
 
NodeStmt * parseNodeStmt(Iterator current, Iterator &rest)
 
EdgeRhs * parseEdgeRhs(Iterator current, Iterator &rest)
 
std::vector< Token > Tokens
 
AttrStmt * parseAttrStmt(Iterator current, Iterator &rest)
 
Ast(const Tokens &tokens)
Initializes AST building but does not trigger the process itself.
 
EdgeStmt * parseEdgeStmt(Iterator current, Iterator &rest)
 
AsgnStmt * parseAsgnStmt(Iterator current, Iterator &rest)
 
CompassPt * parseCompassPt(Iterator current, Iterator &rest)
 
Graph * root() const
Returns the root of the AST (nullptr if none).
 
AttrList * parseAttrList(Iterator current, Iterator &rest)
 
Subgraph * parseSubgraph(Iterator current, Iterator &rest)
 
Stmt * parseStmt(Iterator current, Iterator &rest)
 
AList * parseAList(Iterator current, Iterator &rest)
 
Graph * parseGraph(Iterator current, Iterator &rest)
 
bool build()
Builds the DOT format AST.
 
Tokens::const_iterator Iterator
 
Port * parsePort(Iterator current, Iterator &rest)
 
StmtList * parseStmtList(Iterator current, Iterator &rest)
 
NodeId * parseNodeId(Iterator current, Iterator &rest)
 
bool read(Graph &G, ClusterGraph &C, ClusterGraphAttributes &CA)
 
bool readGraph(Graph &G, GraphAttributes *GA, ClusterGraph *C, ClusterGraphAttributes *CA)
 
bool read(Graph &G, ClusterGraph &C)
 
Parser(std::istream &in)
Initializes parser class with given input (but does nothing to it).
 
bool read(Graph &G, GraphAttributes &GA)
 
node requestNode(Graph &G, GraphAttributes *GA, ClusterGraph *C, const SubgraphData &data, const std::string &id)
Perfoms a node query, returning node for given attribute.
 
HashArray< std::string, node > m_nodeId
 
The namespace for all OGDF objects.
 
AList(AsgnStmt *headAsgnStmt, AList *tailAList)
 
virtual bool read(Parser &P, ogdf::Graph &G, GraphAttributes *GA, ClusterGraph *C, ClusterGraphAttributes *CA, const SubgraphData &data) override
 
AsgnStmt(const std::string &lhsString, const std::string &rhsString)
 
AttrList(AList *headAList, AttrList *tailAttrList)
 
virtual bool read(Parser &P, ogdf::Graph &G, GraphAttributes *GA, ClusterGraph *C, ClusterGraphAttributes *CA, const SubgraphData &data) override
 
AttrStmt(const Type ¶mType, AttrList *attrList)
 
CompassPt(const Type ¶mType)
 
virtual bool read(Parser &P, ogdf::Graph &G, GraphAttributes *GA, ClusterGraph *C, ClusterGraphAttributes *CA, const SubgraphData &data)=0
 
EdgeRhs(EdgeLhs *headEdgeLHS, EdgeRhs *tailEdgeRHS)
 
virtual bool read(Parser &P, ogdf::Graph &G, GraphAttributes *GA, ClusterGraph *C, ClusterGraphAttributes *CA, const SubgraphData &data) override
 
EdgeStmt(EdgeLhs *edgeLHS, EdgeRhs *edgeRHS, AttrList *attrList)
 
Graph(const bool ¶mStrict, const bool &dir, std::string *idString, StmtList *statementList)
 
bool read(Parser &P, ogdf::Graph &G, GraphAttributes *GA, ClusterGraph *C, ClusterGraphAttributes *CA)
 
virtual bool read(Parser &P, ogdf::Graph &G, GraphAttributes *GA, ClusterGraph *C, ClusterGraphAttributes *CA, const SubgraphData &data) override
 
NodeId(const std::string &idString, Port *paramPort)
 
virtual bool read(Parser &P, ogdf::Graph &G, GraphAttributes *GA, ClusterGraph *C, ClusterGraphAttributes *CA, const SubgraphData &data) override
 
NodeStmt(NodeId *nodeID, AttrList *attrList)
 
Port(std::string *idString, CompassPt *compassPT)
 
virtual bool read(Parser &P, ogdf::Graph &G, GraphAttributes *GA, ClusterGraph *C, ClusterGraphAttributes *CA, const SubgraphData &data)=0
 
StmtList(Stmt *headSTMT, StmtList *tailStatementList)
 
Subgraph(std::string *idString, StmtList *statementList)
 
virtual bool read(Parser &P, ogdf::Graph &G, GraphAttributes *GA, ClusterGraph *C, ClusterGraphAttributes *CA, const SubgraphData &data) override
 
A helper structure containing information for recursive graph reading.
 
std::vector< Ast::AttrList * > & edgeDefaults
 
SubgraphData withCluster(cluster newRootCluster) const
Returns almost the same structure, but with root cluster.
 
SubgraphData withNodes(std::set< node > &newNodes) const
Returns almost the same structure, but with new node list.
 
SubgraphData withDefaults(std::vector< Ast::AttrList * > &newNodeDefaults, std::vector< Ast::AttrList * > &newEdgeDefaults) const
Returns almost the same structure, but with new defaults.
 
std::vector< Ast::AttrList * > & nodeDefaults
 
SubgraphData(cluster root, std::vector< Ast::AttrList * > &nodeDefaultsVector, std::vector< Ast::AttrList * > &edgeDefaultsVector, std::set< node > &nodeSet)
Initializes structure with given data.