Create a Java program that implements the implementation of graphs discussed in the lecture.

Test your program using the examples shown on this exercise sheet.

Programmierung: 1. Erstellen Sie ein Java-Programm, das die in der Vorlesung besprochene Implementierung von Graphen umsetzt. 3 Node -obj:Object +Node(obj:Object) getObjecto:Object +toStringo String Graph -nodes. Ust -edges List, edges: Ust) getNodeso List + getEdgeso:List +addEdgeledge Edge) vold +removeEdgeledge:Edge):void +addNodeinode: Nodex void +removeNodeode:Node) void Edge firstNode: Node -secondNode:Node +EdgecfirstNodeNode, secondNodeNode) -getFirstNode.Node -getSecondNode.Node +getNodeso:Nodell DirectedEdge WeightedEdge -weight:double + Weighted Edge(firstNode:Node, secondNode:Node, weight:double) getWeight double DirectedEdge from:Node, to Node) + getFrom:Node +getToo Node Weighted Directed Edge + Weighted Directed Edge(from:Node, to:Node, weight:double) +getFrom:Node +getToo:Node Figure 6: Graphimplementierung Testen Sie ihr Programm anhand der auf diesem Aufgabenblatt dargestellten Beispiele