If the edges E are unordered pairs of vertices, we have an undirected graph (see Resources). To make a binary tree using dot, we should know the following theory. A directed graph with no cycles is ...