From d1b49fbafcd798214cba48f67ba73e07ba4f1bc2 Mon Sep 17 00:00:00 2001
From: Arnaud Vergnet <vergnet@etud.insa-toulouse.fr>
Date: Sun, 29 Mar 2020 10:58:58 +0200
Subject: [PATCH] Added new uml graph

---
 UML/diagramme2/CompleteGraph.uml | 64 ++++++++++++++++++++++++++++++++
 1 file changed, 64 insertions(+)
 create mode 100644 UML/diagramme2/CompleteGraph.uml

diff --git a/UML/diagramme2/CompleteGraph.uml b/UML/diagramme2/CompleteGraph.uml
new file mode 100644
index 0000000..bc7c05c
--- /dev/null
+++ b/UML/diagramme2/CompleteGraph.uml
@@ -0,0 +1,64 @@
+<?xml version="1.0" encoding="UTF-8"?>
+<Diagram>
+  <ID>JAVA</ID>
+  <OriginalElement>org.insa.graphs.algorithm.AbstractAlgorithm</OriginalElement>
+  <nodes>
+    <node x="0.0" y="524.0">org.insa.graphs.algorithm.AbstractInputData</node>
+    <node x="127.49999999999999" y="89.0">org.insa.graphs.algorithm.shortestpath.ShortestPathAlgorithm</node>
+    <node x="151.5" y="0.0">org.insa.graphs.algorithm.AbstractAlgorithm</node>
+    <node x="0.0" y="178.0">org.insa.graphs.algorithm.shortestpath.DijkstraAlgorithm</node>
+    <node x="394.0" y="440.0">org.insa.graphs.algorithm.shortestpath.ShortestPathSolution</node>
+    <node x="6.0" y="613.0">org.insa.graphs.algorithm.shortestpath.ShortestPathData</node>
+    <node x="0.0" y="697.0">org.insa.graphs.algorithm.AlgorithmFactory</node>
+    <node x="285.0" y="178.0">org.insa.graphs.algorithm.shortestpath.BellmanFordAlgorithm</node>
+    <node x="310.0" y="524.0">org.insa.graphs.algorithm.ArcInspectorFactory</node>
+    <node x="0.0" y="440.0">org.insa.graphs.algorithm.shortestpath.ShortestPathTextObserver</node>
+    <node x="298.0" y="697.0">org.insa.graphs.algorithm.ArcInspector</node>
+    <node x="24.0" y="351.0">org.insa.graphs.algorithm.shortestpath.ShortestPathObserver</node>
+    <node x="418.0" y="351.0">org.insa.graphs.algorithm.AbstractSolution</node>
+    <node x="18.0" y="267.0">org.insa.graphs.algorithm.shortestpath.AStarAlgorithm</node>
+  </nodes>
+  <notes />
+  <edges>
+    <edge source="org.insa.graphs.algorithm.shortestpath.ShortestPathData" target="org.insa.graphs.algorithm.AbstractInputData">
+      <point x="0.0" y="-19.5" />
+      <point x="0.0" y="19.5" />
+    </edge>
+    <edge source="org.insa.graphs.algorithm.shortestpath.DijkstraAlgorithm" target="org.insa.graphs.algorithm.shortestpath.ShortestPathAlgorithm">
+      <point x="0.0" y="-19.5" />
+      <point x="132.5" y="153.0" />
+      <point x="205.75" y="153.0" />
+      <point x="-78.25" y="19.5" />
+    </edge>
+    <edge source="org.insa.graphs.algorithm.shortestpath.ShortestPathSolution" target="org.insa.graphs.algorithm.AbstractSolution">
+      <point x="0.0" y="-19.5" />
+      <point x="0.0" y="19.5" />
+    </edge>
+    <edge source="org.insa.graphs.algorithm.shortestpath.ShortestPathAlgorithm" target="org.insa.graphs.algorithm.AbstractAlgorithm">
+      <point x="0.0" y="-19.5" />
+      <point x="0.0" y="19.5" />
+    </edge>
+    <edge source="org.insa.graphs.algorithm.shortestpath.BellmanFordAlgorithm" target="org.insa.graphs.algorithm.shortestpath.ShortestPathAlgorithm">
+      <point x="0.0" y="-19.5" />
+      <point x="435.5" y="153.0" />
+      <point x="362.25" y="153.0" />
+      <point x="78.25" y="19.5" />
+    </edge>
+    <edge source="org.insa.graphs.algorithm.shortestpath.ShortestPathTextObserver" target="org.insa.graphs.algorithm.shortestpath.ShortestPathObserver">
+      <point x="0.0" y="-19.5" />
+      <point x="0.0" y="19.5" />
+    </edge>
+    <edge source="org.insa.graphs.algorithm.shortestpath.AStarAlgorithm" target="org.insa.graphs.algorithm.shortestpath.DijkstraAlgorithm">
+      <point x="0.0" y="-19.5" />
+      <point x="0.0" y="19.5" />
+    </edge>
+  </edges>
+  <settings layout="Hierarchic Group" zoom="1.0" x="347.5" y="368.0" />
+  <SelectedNodes>
+    <node>org.insa.graphs.algorithm.AbstractAlgorithm</node>
+  </SelectedNodes>
+  <Categories />
+  <SCOPE>All</SCOPE>
+  <VISIBILITY>private</VISIBILITY>
+</Diagram>
+