Branching out

Added functionality for a graph to be "recognised" as a tree (if undirected, fully connected, and with no cycles) and if so offer the standard tree traversal algorithms.

These come with caveats, as this is not any sort of rooted or ordered tree - so results may seem misleading in terms of tree traversals, but they work best if the nodes are created and arranged in the same order.