Nodes, cycles and paths

There are 7 computers with identifiers A, B, ..., G, linked in the following network:

To reduce the maintenance cost of the network, we want to remove some links and keep those that are actually needed. The only requirement is that all pairs of computers in the network should be connected directly or through other computers. What is the maximal number of links that can be removed from this network?

Print all links that should remain in the network in the field below. The expected output format is the following:

A B
B C
C D
D E

Here, each line represents an edge of the resulting network.