vergnet/BE-GRAPH
1
0
Fork 0
Code Issues Pull requests Releases Wiki Activity

Added new uml graph

Browse source
This commit is contained in:
Arnaud Vergnet 2020-03-29 10:58:58 +02:00
parent 3d095626ab
commit d1b49fbafc
1 changed files with 64 additions and 0 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

64
UML/diagramme2/CompleteGraph.uml Normal file
View file

@ -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>