Rules to construct a well formed Glide graph expression:

• The minimum number of parentheses is used.
• The label of the nodes eventually concatenated with a list of '%' and integers is always followed by '/'.

• a/b/((a/b/c/)a/b/)

• a/b

• a/+

In addition,  the Glide language can be used to store graphs in a compact way. A depth first search algorithm can be used to generate a Glide representation of a graph. When visiting  a node, its label is printed  followed by '/' (unless this node is visited during a backtracking step). When the next node to be visited has unvisited siblings a '(' is printed. A ')' is printed when all the siblings have been visited. In a cycle, the first and last node representations are labeled  by inserting '%' followed by a unique (for each cycle) integer before '/'.