Version 5.0 The LEDA User Manual

void parser.add graph done rule(gml graph rule f)
void parser.add node done rule(gml node rule f)
void parser.add edge done rule(gml edge rule f)
4. Implementation
adds graph rule f to parser. During parsing f is called whenever
an object o with path graph and type gml list is encountered.
f is called after all objects in the list of o are
parsed.
adds node rule f to parser for path graph.node and value type
gml list. f is called after all objects in the corresponding list
are parsed.
adds edge rule f to parser for path graph.edge and value type
gml list. f is called after all objects in the corresponding list
are parsed.
The data type gml graph is realized using lists and maps. It inherits from gml parser
which uses gml object, gml objecttree, and gml pattern. gml pattern uses dictionaries.