Submit the Java source code to the open Deliverable A submission folder. You may submit either the source code or a full Eclipse package.

1. Write code necessary to print out, for each Edge, the name of the Node from which the Edge emanates, the name of the Node at which the Edge terminates, and the label of the Edge, in the format listed below.

Output:

Here is sample output for one graph.

~ val AAA BB C DDD E

Alfa x ~ > ~ 99 fig

Bravo 67 999 -42 3 x ==

Charlie ~ ~ 4 ~ yz 9

Delta 4e 3 22 x ~ !=2

Echo yes ~ ~ ~ d>e 33

The output for this file should be:

Edge from Alpha to Bravo labeled >.

Edge from Alpha to Delta labeled 99.

Edge from Alpha to Echo labeled fig.

Edge from Bravo to Alpha labeled 999.

Edge from Bravo to Bravo labeled -42.

Edge from Bravo to Charlie labeled 3.

Edge from Bravo to Delta labeled x.

Edge from Bravo to Echo labeled ==.

Edge from Charlie to Bravo labeled 4.

Edge from Charlie to Delta labeled yz.

Edge from Charlie to Echo labeled 9.

Edge from Delta to Alpha labeled 3.

Edge from Delta to Bravo labeled 22.

Edge from Delta to Charlie labeled x.

Edge from Delta to Echo labeled !=2.

Edge from Echo to Delta labeled d>e.

Edge from Echo to Echo labeled 33.

The order in which the Edges print out is not important.

Submit:

Submit your code as an Eclipse package. You dont need to include test files.[1]