||Encodes the dafsa into a string notation.
Each node is printed on its own line with all the nodes that precede it.
The end node is designated with the "$" character.
If it joins into an existing node, the end of the line is adorned with a "=".
Though this doesn't carry information about which other prefix it has joined with,
it has seemed to be precise enough for testing.
For example, with the input data of:
[root] --- a ---- 1 --- [end]
| | /
-- b -- c---
The output will be:
a1$ <- end node was found
ac1= <- joins with the "a1" prefix
bc= <- joins with the "ac" prefix