added all past projects

Uni/Java/WS1516/Programmieren/Final01/bin/README.txt

@@ -0,0 +1,35 @@
+1. Die Klassen "TestSuite", "ExpectionInputStream", "ExpectionOutputStream" in das Projekt kopieren.
+
+2. Beim Start der TestSuite-Klasse wird nach dem Ordner der Testfälle gefragt,
+   berücksichtige dabei dass der Projekt Ordner als Start-Verzeichnis gilt.
+
+3. Danach wird nach der zu testenden Klasse gefragt, gebe hier einfach den Namen der Klasse im Package
+   "edu.kit.informatik" an, die als Main-Klasse gehandelt wird.
+
+4. Die test-Dateien müssen so benannt sein: "*.test" und forlgender formatierung folgen:
+        - Ein Testfall wird dargestellt als:      <expected> : "<actual>"
+        - Wobei 'expected' eine Zeichenkette über mehrere Zeilen sein kann, die dem
+          regulären Ausdruck [a-zA-Z0-9\\s]+ entspricht. 'expected' stellt dabei die erwartete Ausgabe dar.
+          'expected' muss entweder "true", "false", einer Zahl oder einer Zeichenkette
+          gekennzeichnet durch " entsprechen.
+          'expected' kann nur als Zeichenkette mehrzeilig sein, solange der Zeilenumsprung
+          in den " ist.
+
+        - und 'actual' eine Zeichenkette über eine Zeile sein kann, die dem regulären Ausdruck
+          [a-zA-Z0-9\\s-;]+ entspricht. 'actual' stellt dabei die Eingabe eines Befehls dar.
+        - Die Kommandozeilenargumente werden dargestellt als:
+                                                  <"cmd1";"cmd2";...>
+          Wobei cmd1 ein Kommandozeilenargument darstellt.
+          Die Kommandozeilenargumente müssen in der ersten Zeile der .test-Datei stehen.
+
+5. Ein Beispiel für den Test-Fall auf dem Aufgabenblatt:
+
+<"src\edu\kit\informatik\tests\test.graph">
+6 : "search bB;d;route"
+"bB Aa C d" : "route bB;d;route"
+"bB Aa C d
+bB Aa d
+bB C Aa d
+bB C d" : "route bB;d;all"
+"Aa
+C" : "nodes bB"

Uni/Java/WS1516/Programmieren/Final01/bin/docs.tex

@@ -0,0 +1,96 @@
+\begin{texdocpackage}{edu.kit.informatik}
+\label{texdoclet:edu.kit.informatik}
+
+\begin{texdocclass}{class}{Constant}
+\label{texdoclet:edu.kit.informatik.Constant}
+\begin{texdocclassintro}
+All constants used in the program\end{texdocclassintro}
+\begin{texdocclassfields}
+\texdocfield{public static final}{String}{CODE\_NOT\_ACCESSIBLE}{The Constant CODE\_NOT\_ACCESSIBLE.}
+\texdocfield{public static final}{String}{COMMAND\_NOT\_FOUND}{The Constant COMMAND\_NOT\_FOUND.}
+\texdocfield{public static final}{String}{COMMAND\_SUCCESSFUL}{The Constant COMMAND\_SUCCESSFUL.}
+\texdocfield{public static final}{String}{EDGE\_CANNOT\_REMOVE}{The Constant EDGE\_CANNOT\_REMOVE.}
+\texdocfield{public static final}{String}{EDGE\_CONTAINED\_ALLREADY}{The Constant EDGE\_CONTAINED\_ALLREADY.}
+\texdocfield{public static final}{String}{EDGE\_VERTEX\_NOT\_FOUND}{The Constant EDGE\_VERTEX\_NOT\_FOUND.}
+\texdocfield{public static final}{String}{FILE\_WRONG\_FORMAT}{The Constant FILE\_WRONG\_FORMAT.}
+\texdocfield{public static final}{String}{GRAPH\_EDGE\_LESS\_THAN\_ONE}{The Constant GRAPH\_EDGE\_LESS\_THAN\_ONE.}
+\texdocfield{public static final}{String}{GRAPH\_NOT\_CONTINOUS}{The Constant GRAPH\_NOT\_CONTINOUS.}
+\texdocfield{public static final}{String}{GRAPH\_VERTEX\_LESS\_THAN\_TWO}{The Constant GRAPH\_VERTEX\_LESS\_THAN\_TWO.}
+\texdocfield{public static final}{String}{NUMBER\_FORMAT\_ILLEGAL}{The Constant NUMBER\_FORMAT\_ILLEGAL.}
+\texdocfield{public static final}{String}{PREFIX\_ERROR}{The Constant PREFIX\_ERROR.}
+\texdocfield{public static final}{String}{REGEX\_CITY\_NAME}{The regex for a city name.}
+\texdocfield{public static final}{String}{REGEX\_CRITERION\_ALL}{The Constant REGEX\_CRITERION\_ALL.}
+\texdocfield{public static final}{String}{REGEX\_CRITERION\_BOTH}{The Constant REGEX\_CRITERION\_BOTH.}
+\texdocfield{public static final}{String}{REGEX\_CRITERION\_DISTANCE}{The Constant REGEX\_CRITERION\_DISTANCE.}
+\texdocfield{public static final}{String}{REGEX\_CRITERION\_TIME}{The Constant REGEX\_CRITERION\_TIME.}
+\texdocfield{public static final}{String}{REGEX\_EDGE}{The regex for an edge.}
+\texdocfield{public static final}{String}{REGEX\_GRAPH\_FILE}{The regex for a file that contains a graph.}
+\texdocfield{public static final}{String}{REGEX\_POSITIVE\_INTEGER}{The regex for a positive integer.}
+\texdocfield{public static final}{String}{REGEX\_ROUTE}{The Constant REGEX\_ROUTE.}
+\texdocfield{public static final}{String}{REGEX\_SEARCH}{The Constant REGEX\_SEARCH.}
+\texdocfield{public static final}{String}{SEPARATOR}{The regex for the SEPARATOR of the two parts in the file.}
+\texdocfield{public static final}{String}{VERTEX\_DUPLICATE}{The Constant VERTEX\_DUPLICATE.}
+\texdocfield{public static final}{String}{VERTEX\_NOT\_FOUND}{The Constant VERTEX\_NOT\_FOUND.}
+\end{texdocclassfields}
+\end{texdocclass}
+
+
+\begin{texdocclass}{class}{FileInputHelper}
+\label{texdoclet:edu.kit.informatik.FileInputHelper}
+\begin{texdocclassintro}
+Helper class for reading text files.\end{texdocclassintro}
+\begin{texdocclassmethods}
+\texdocmethod{public static}{String}{read}{(String file)}{Reads the specified file and returns its content as a String array, where
+ the first array field contains the file's first line, the second field
+ contains the second line, and so on.}{\begin{texdocparameters}
+\texdocparameter{file}{the file to be read}
+\end{texdocparameters}
+\texdocreturn{the content of the file}
+}
+\end{texdocclassmethods}
+\end{texdocclass}
+
+
+\begin{texdocclass}{class}{Main}
+\label{texdoclet:edu.kit.informatik.Main}
+\begin{texdocclassintro}
+The Class Main.\end{texdocclassintro}
+\begin{texdocclassmethods}
+\texdocmethod{public static}{void}{main}{(String args)}{The main method.}{\begin{texdocparameters}
+\texdocparameter{args}{the arguments}
+\end{texdocparameters}
+}
+\end{texdocclassmethods}
+\end{texdocclass}
+
+
+\begin{texdocclass}{class}{Terminal}
+\label{texdoclet:edu.kit.informatik.Terminal}
+\begin{texdocclassintro}
+This class provides some simple methods for input$/$output from and to a
+ terminal.
+ \begin{texdocp}
+ Never modify this class, never upload it to Praktomat. This is only for your
+ local use. If an assignment tells you to use this class for input and output
+ never use System.out or System.in in the same assignment.\end{texdocp}\end{texdocclassintro}
+\begin{texdocclassmethods}
+\texdocmethod{public static}{void}{printLine}{(String out)}{Print a String to the standard output.
+ \begin{texdocp}
+ The String out must not be null.\end{texdocp}}{\begin{texdocparameters}
+\texdocparameter{out}{The string to be printed.}
+\end{texdocparameters}
+}
+\texdocmethod{public static}{String}{readLine}{()}{Reads a line from standard input.
+ \begin{texdocp}
+ Returns null at the end of the standard input.
+ \begin{texdocp}
+ Use Ctrl+D to indicate the end of the standard input.\end{texdocp}\end{texdocp}}{\texdocreturn{The next line from the standard input or null.}
+}
+\end{texdocclassmethods}
+\end{texdocclass}
+
+
+\end{texdocpackage}
+
+
+

Uni/Java/WS1516/Programmieren/Final01/bin/edu/kit/informatik/tests/test.graph

@@ -0,0 +1,10 @@
+Aa
+bB
+C
+d
+--
+Aa;bB;1;3
+Aa;C;2;4
+Aa;d;11;20
+bB;C;5;2
+C;d;3;1

Uni/Java/WS1516/Programmieren/Final01/bin/graphs/duplicateEdge.txt

@@ -0,0 +1,7 @@
+Aa
+bB
+C
+d
+--
+Aa;bB;1;3
+Aa;bB;2;4

Uni/Java/WS1516/Programmieren/Final01/bin/graphs/duplicateVertex.txt

@@ -0,0 +1,11 @@
+Aa
+aA
+AA
+aa
+bB
+--
+aa;bB;1;3
+Aa;C;2;4
+Aa;d;11;20
+bB;C;5;2
+C;d;3;1

Uni/Java/WS1516/Programmieren/Final01/bin/graphs/edgeWithoutVertex.txt

@@ -0,0 +1,5 @@
+bB
+C
+d
+--
+Aa;bB;1;3

Uni/Java/WS1516/Programmieren/Final01/bin/graphs/negativeNumber.txt

@@ -0,0 +1,4 @@
+Aa
+bB
+--
+Aa;bB;1;-3

Uni/Java/WS1516/Programmieren/Final01/bin/graphs/noDivider.txt

@@ -0,0 +1,9 @@
+Aa
+bB
+C
+d
+Aa;bB;1;3
+Aa;C;2;4
+Aa;d;11;20
+bB;C;5;2
+C;d;3;1

Uni/Java/WS1516/Programmieren/Final01/bin/graphs/noFirstPart.txt

@@ -0,0 +1,6 @@
+--
+Aa;bB;1;3
+Aa;C;2;4
+Aa;d;11;20
+bB;C;5;2
+C;d;3;1

Uni/Java/WS1516/Programmieren/Final01/bin/graphs/noSecondPart.txt

@@ -0,0 +1,5 @@
+Aa
+bB
+C
+d
+--

Uni/Java/WS1516/Programmieren/Final01/bin/graphs/notContinous.txt

@@ -0,0 +1,6 @@
+Aa
+bB
+C
+d
+--
+Aa;bB;1;3

Uni/Java/WS1516/Programmieren/Final01/bin/graphs/numberOverflow.txt

@@ -0,0 +1,10 @@
+Aa
+bB
+C
+d
+--
+Aa;bB;1;3
+Aa;C;2;4
+Aa;d;11;20
+bB;C;5;2
+C;d;3;30000000000

Uni/Java/WS1516/Programmieren/Final01/bin/graphs/numberZero.txt

@@ -0,0 +1,5 @@
+C
+d
+--
+bB;C;5;2
+C;d;0;0

Uni/Java/WS1516/Programmieren/Final01/bin/inputFile.txt

@@ -0,0 +1,15 @@
+Aa
+bB
+C
+d
+e
+f
+--
+Aa;bB;1;+003
+Aa;C;2;4
+Aa;d;11;20
+bb;D;1;1
+bB;C;5;2
+C;d;1;1
+d;e;1;1
+f;e;1;1

Uni/Java/WS1516/Programmieren/Final01/bin/insert.test

@@ -0,0 +1,20 @@
+<"C:\Eclipse\workspace\Final01\tests\test.graph">
+#Errors
+00err : "insert "
+00err : "insert null"
+00err : "insert null;null;;"
+00err : "insert null;null;null;null"
+00err : "insert null;null;null;null;null;null"
+00err : "insert Aa;EE;Cee;1"
+00err : "insert Aa;EE;1;dee"
+00err : "insert Aa;Aa;5;4"
+00err : "insert Aa;bb;10;5"
+00err : "insert bB;d;50000000000;5"
+#00err : "insert Aa;Aa;-5;4"
+00err : "insert bB;d;1;0"
+00err : "insert bB;d;0;0"
+
+#Works
+"OK" : "insert Aa;ee;1;10"
+"OK" : "insert bB;d;2;5"
+#"OK" : "insert --;d;2;5"

Uni/Java/WS1516/Programmieren/Final01/bin/logs/nodesInsertTest.log

@@ -0,0 +1,10 @@
+Error, vertex not found
+Aa
+bB
+d
+OK
+C
+Aa
+bB
+d
+ee

Uni/Java/WS1516/Programmieren/Final01/bin/logs/nodesRemoveTest.log

@@ -0,0 +1,6 @@
+OK
+C
+C
+d
+Error, edge can't be removed
+OK

Uni/Java/WS1516/Programmieren/Final01/bin/logs/nodesTest.log

@@ -0,0 +1,18 @@
+Error, please use a valid command (valid commands: 'quit' 'info' 'vertices' 'nodes <City>' 'remove <firstCity>;<secondCity>' 'insert <firstCity>;<secondCity>;<distanceKilometer>;<distanceMinutes>' 'route <startCity>;<destinationCity>;<time|route|optimal|all>' 'search <startCity>;<destinationCity>;<time|route|optimal>'  [numbers can't be zero or less])
+Error, vertex not found
+Error, please use a valid command (valid commands: 'quit' 'info' 'vertices' 'nodes <City>' 'remove <firstCity>;<secondCity>' 'insert <firstCity>;<secondCity>;<distanceKilometer>;<distanceMinutes>' 'route <startCity>;<destinationCity>;<time|route|optimal|all>' 'search <startCity>;<destinationCity>;<time|route|optimal>'  [numbers can't be zero or less])
+Error, vertex not found
+Error, vertex not found
+bB
+C
+d
+bB
+C
+d
+Aa
+bB
+d
+Aa
+C
+Aa
+C

Uni/Java/WS1516/Programmieren/Final01/bin/logs/publicTestTest.log

@@ -0,0 +1,8 @@
+6
+bB Aa C d
+bB Aa C d
+bB Aa d
+bB C Aa d
+bB C d
+Aa
+C

Uni/Java/WS1516/Programmieren/Final01/bin/logs/removeTest.log

@@ -0,0 +1,10 @@
+Error, please use a valid command (valid commands: 'quit' 'info' 'vertices' 'nodes <City>' 'remove <firstCity>;<secondCity>' 'insert <firstCity>;<secondCity>;<distanceKilometer>;<distanceMinutes>' 'route <startCity>;<destinationCity>;<time|route|optimal|all>' 'search <startCity>;<destinationCity>;<time|route|optimal>'  [numbers can't be zero or less])
+Error, please use a valid command (valid commands: 'quit' 'info' 'vertices' 'nodes <City>' 'remove <firstCity>;<secondCity>' 'insert <firstCity>;<secondCity>;<distanceKilometer>;<distanceMinutes>' 'route <startCity>;<destinationCity>;<time|route|optimal|all>' 'search <startCity>;<destinationCity>;<time|route|optimal>'  [numbers can't be zero or less])
+Error, please use a valid command (valid commands: 'quit' 'info' 'vertices' 'nodes <City>' 'remove <firstCity>;<secondCity>' 'insert <firstCity>;<secondCity>;<distanceKilometer>;<distanceMinutes>' 'route <startCity>;<destinationCity>;<time|route|optimal|all>' 'search <startCity>;<destinationCity>;<time|route|optimal>'  [numbers can't be zero or less])
+Error, please use a valid command (valid commands: 'quit' 'info' 'vertices' 'nodes <City>' 'remove <firstCity>;<secondCity>' 'insert <firstCity>;<secondCity>;<distanceKilometer>;<distanceMinutes>' 'route <startCity>;<destinationCity>;<time|route|optimal|all>' 'search <startCity>;<destinationCity>;<time|route|optimal>'  [numbers can't be zero or less])
+OK
+OK
+OK
+OK
+OK
+

Uni/Java/WS1516/Programmieren/Final01/bin/logs/removeTillEmptyTest.log

@@ -0,0 +1,6 @@
+OK
+OK
+OK
+OK
+OK
+

Uni/Java/WS1516/Programmieren/Final01/bin/logs/removeTillNotCoherentTest.log

@@ -0,0 +1,7 @@
+OK
+OK
+OK
+OK
+OK
+Error, vertex not found
+Error, edge contains vertices that have not been initilized

Uni/Java/WS1516/Programmieren/Final01/bin/logs/routeTest.log

@@ -0,0 +1,97 @@
+Error, please use a valid command (valid commands: 'quit' 'info' 'vertices' 'nodes <City>' 'remove <firstCity>;<secondCity>' 'insert <firstCity>;<secondCity>;<distanceKilometer>;<distanceMinutes>' 'route <startCity>;<destinationCity>;<time|route|optimal|all>' 'search <startCity>;<destinationCity>;<time|route|optimal>'  [numbers can't be zero or less])
+Error, please use a valid command (valid commands: 'quit' 'info' 'vertices' 'nodes <City>' 'remove <firstCity>;<secondCity>' 'insert <firstCity>;<secondCity>;<distanceKilometer>;<distanceMinutes>' 'route <startCity>;<destinationCity>;<time|route|optimal|all>' 'search <startCity>;<destinationCity>;<time|route|optimal>'  [numbers can't be zero or less])
+Error, please use a valid command (valid commands: 'quit' 'info' 'vertices' 'nodes <City>' 'remove <firstCity>;<secondCity>' 'insert <firstCity>;<secondCity>;<distanceKilometer>;<distanceMinutes>' 'route <startCity>;<destinationCity>;<time|route|optimal|all>' 'search <startCity>;<destinationCity>;<time|route|optimal>'  [numbers can't be zero or less])
+Error, vertex not found
+Error, vertex not found
+Error, vertex not found
+Error, vertex not found
+Aa
+Aa
+Aa
+Aa
+Aa bB
+Aa bB
+Aa bB
+Aa bB
+Aa C bB
+Aa d C bB
+Aa C
+Aa C
+Aa C
+Aa bB C
+Aa C
+Aa d C
+Aa C d
+Aa C d
+Aa C d
+Aa bB C d
+Aa C d
+Aa d
+bB
+bB
+bB
+bB
+bB Aa
+bB Aa
+bB Aa
+bB Aa
+bB C Aa
+bB C d Aa
+bB C
+bB Aa C
+bB C
+bB Aa C
+bB Aa d C
+bB C
+bB C d
+bB Aa C d
+bB C d
+bB Aa C d
+bB Aa d
+bB C Aa d
+bB C d
+C
+C
+C
+C
+C Aa
+C Aa
+C Aa
+C Aa
+C bB Aa
+C d Aa
+C bB
+C Aa bB
+C bB
+C Aa bB
+C bB
+C d Aa bB
+C d
+C d
+C d
+C Aa d
+C bB Aa d
+C d
+d
+d
+d
+d
+d C Aa
+d C Aa
+d C Aa
+d Aa
+d C Aa
+d C bB Aa
+d C bB
+d C Aa bB
+d C bB
+d Aa bB
+d Aa C bB
+d C Aa bB
+d C bB
+d C
+d C
+d C
+d Aa bB C
+d Aa C
+d C

Uni/Java/WS1516/Programmieren/Final01/bin/logs/searchTest.log

@@ -0,0 +1,55 @@
+Error, please use a valid command (valid commands: 'quit' 'info' 'vertices' 'nodes <City>' 'remove <firstCity>;<secondCity>' 'insert <firstCity>;<secondCity>;<distanceKilometer>;<distanceMinutes>' 'route <startCity>;<destinationCity>;<time|route|optimal|all>' 'search <startCity>;<destinationCity>;<time|route|optimal>'  [numbers can't be zero or less])
+Error, please use a valid command (valid commands: 'quit' 'info' 'vertices' 'nodes <City>' 'remove <firstCity>;<secondCity>' 'insert <firstCity>;<secondCity>;<distanceKilometer>;<distanceMinutes>' 'route <startCity>;<destinationCity>;<time|route|optimal|all>' 'search <startCity>;<destinationCity>;<time|route|optimal>'  [numbers can't be zero or less])
+Error, please use a valid command (valid commands: 'quit' 'info' 'vertices' 'nodes <City>' 'remove <firstCity>;<secondCity>' 'insert <firstCity>;<secondCity>;<distanceKilometer>;<distanceMinutes>' 'route <startCity>;<destinationCity>;<time|route|optimal|all>' 'search <startCity>;<destinationCity>;<time|route|optimal>'  [numbers can't be zero or less])
+Error, vertex not found
+Error, vertex not found
+Error, vertex not found
+Error, vertex not found
+0
+0
+0
+3
+1
+10
+4
+2
+20
+5
+5
+50
+0
+0
+0
+3
+1
+10
+2
+3
+29
+3
+6
+73
+0
+0
+0
+4
+2
+20
+2
+3
+29
+1
+3
+10
+0
+0
+0
+5
+5
+50
+3
+6
+73
+1
+3
+10

Uni/Java/WS1516/Programmieren/Final01/bin/logs/test1Test.log

@@ -0,0 +1 @@
+Error, please use a valid command (valid commands: 'quit' 'info' 'vertices' 'nodes <City>' 'remove <firstCity>;<secondCity>' 'insert <firstCity>;<secondCity>;<distanceKilometer>;<distanceMinutes>' 'route <startCity>;<destinationCity>;<time|route|optimal|all>' 'search <startCity>;<destinationCity>;<time|route|optimal>'  [numbers can't be zero or less])

Uni/Java/WS1516/Programmieren/Final01/bin/logs/test2Test.log

@@ -0,0 +1 @@
+Error, please use a valid command (valid commands: 'quit' 'info' 'vertices' 'nodes <City>' 'remove <firstCity>;<secondCity>' 'insert <firstCity>;<secondCity>;<distanceKilometer>;<distanceMinutes>' 'route <startCity>;<destinationCity>;<time|route|optimal|all>' 'search <startCity>;<destinationCity>;<time|route|optimal>'  [numbers can't be zero or less])

Uni/Java/WS1516/Programmieren/Final01/bin/logs/treeGraphTest.log

@@ -0,0 +1,68 @@
+A
+B
+C
+D
+E
+F
+G
+--
+A;B;2;5
+A;C;100;2
+B;D;100;60
+B;E;300;20
+C;F;4;4
+C;G;20;6
+B
+C
+A
+D
+E
+A
+F
+G
+B
+B
+C
+C
+A B
+A B
+A B
+A B
+5
+2
+29
+A C
+A C
+A C
+A C
+2
+100
+10004
+A B D
+A B D
+A B D
+A B D
+65
+102
+14629
+A B E
+A B E
+A B E
+A B E
+25
+302
+91829
+A C F
+A C F
+A C F
+A C F
+6
+104
+10852
+A C G
+A C G
+A C G
+A C G
+8
+120
+14464

Uni/Java/WS1516/Programmieren/Final01/bin/logs/verticesTest.log

@@ -0,0 +1,12 @@
+Error, please use a valid command (valid commands: 'quit' 'info' 'vertices' 'nodes <City>' 'remove <firstCity>;<secondCity>' 'insert <firstCity>;<secondCity>;<distanceKilometer>;<distanceMinutes>' 'route <startCity>;<destinationCity>;<time|route|optimal|all>' 'search <startCity>;<destinationCity>;<time|route|optimal>'  [numbers can't be zero or less])
+Error, please use a valid command (valid commands: 'quit' 'info' 'vertices' 'nodes <City>' 'remove <firstCity>;<secondCity>' 'insert <firstCity>;<secondCity>;<distanceKilometer>;<distanceMinutes>' 'route <startCity>;<destinationCity>;<time|route|optimal|all>' 'search <startCity>;<destinationCity>;<time|route|optimal>'  [numbers can't be zero or less])
+Aa
+bB
+C
+d
+OK
+OK
+OK
+OK
+OK
+

Uni/Java/WS1516/Programmieren/Final01/bin/nodes.test

@@ -0,0 +1,22 @@
+<"C:\Eclipse\workspace\Final01\tests\test.graph">
+#Errors
+00err : "nodes "
+00err : "nodes null"
+00err : "nodes ;;"
+00err : "nodes e"
+00err : "nodes cc"
+
+#Nodes of all
+"bB
+C
+d" : "nodes Aa"
+"bB
+C
+d" : "nodes aa"
+"Aa
+bB
+d" : "nodes C"
+"Aa
+C" : "nodes d"
+"Aa
+C" : "nodes bB"

Uni/Java/WS1516/Programmieren/Final01/bin/nodesInsert.test

@@ -0,0 +1,11 @@
+<"C:\Eclipse\workspace\Final01\tests\test.graph">
+00err : "nodes ee"
+"Aa
+bB
+d" : "nodes C"
+"OK" : "insert C;ee;2;13"
+"C" : "nodes ee"
+"Aa
+bB
+d
+ee" : "nodes C"

Uni/Java/WS1516/Programmieren/Final01/bin/nodesRemove.test

@@ -0,0 +1,7 @@
+<"C:\Eclipse\workspace\Final01\tests\test.graph">
+"OK" : "remove bB;Aa"
+"C" : "nodes bB"
+"C
+d" : "nodes Aa"
+00err : "remove Aa;bB"
+"OK" : "remove C;Aa"

Uni/Java/WS1516/Programmieren/Final01/bin/publicTest.test

@@ -0,0 +1,9 @@
+<"C:\Eclipse\workspace\Final01\src\edu\kit\informatik\tests\test.graph">
+6 : "search bB;d;route"
+"bB Aa C d" : "route bB;d;route"
+"bB Aa C d
+bB Aa d
+bB C Aa d
+bB C d" : "route bB;d;all"
+"Aa
+C" : "nodes bB"

Uni/Java/WS1516/Programmieren/Final01/bin/remove.test

@@ -0,0 +1,16 @@
+<"C:\Eclipse\workspace\Final01\tests\test.graph">
+#init
+#Errors
+00err : "remove "
+00err : "remove null;"
+00err : "remove null;null;null"
+00err : "remove ;"
+
+"OK" : "remove C;d"
+"OK" : "remove bB;C"
+"OK" : "remove d;aa"
+"OK" : "remove aa;c"
+"OK" : "remove aa;bb"
+
+"
+" : "info"

Uni/Java/WS1516/Programmieren/Final01/bin/removeTillEmpty.test

@@ -0,0 +1,9 @@
+<"C:\Eclipse\workspace\Final01\tests\test.graph">
+"OK" : "remove C;bB"
+"OK" : "remove C;d"
+"OK" : "remove Aa;d"
+"OK" : "remove Aa;bB"
+"OK" : "remove Aa;C"
+
+"
+" : "info"

Uni/Java/WS1516/Programmieren/Final01/bin/removeTillNotCoherent.test

@@ -0,0 +1,8 @@
+<"C:\Eclipse\workspace\Final01\tests\test.graph">
+"OK" : "remove bB;C"
+"!Cok" : "remove C;d"
+"OK" : "remove Aa;d"
+"OK" : "remove Aa;C"
+"OK" : "remove Aa;bB"
+00err : "nodes Aa"
+00err : "insert Aa;ee;10;5"

Uni/Java/WS1516/Programmieren/Final01/bin/route.test

@@ -0,0 +1,120 @@
+<"C:\Eclipse\workspace\Final01\tests\test.graph">
+#72 Testcases
+#Errors
+00err : "route "
+00err : "route null;null;null"
+00err : "route null;null;null;null"
+00err : "route null;null;time"
+00err : "route null;null;route"
+00err : "route null;null;optimal"
+00err : "route ceee;deeee;optimal;"
+
+#Aa to all others
+"Aa" : "route Aa;Aa;time"
+"Aa" : "route Aa;Aa;route"
+"Aa" : "route Aa;Aa;optimal"
+"Aa" : "route Aa;Aa;all"
+
+"Aa bB" : "route Aa;bB;time"
+"Aa bB" : "route Aa;bB;route"
+"Aa bB" : "route Aa;bB;optimal"
+"Aa bB
+Aa C bB
+Aa d C bB" : "route Aa;bB;all"
+
+"Aa C" : "route Aa;C;time"
+"Aa C" : "route Aa;C;route"
+"Aa C" : "route Aa;C;optimal"
+"Aa bB C
+Aa C
+Aa d C" : "route Aa;C;all"
+
+"Aa C d" : "route Aa;d;time"
+"Aa C d" : "route Aa;d;route"
+"Aa C d" : "route Aa;d;optimal"
+"Aa bB C d
+Aa C d
+Aa d" : "route Aa;d;all"
+
+#bB to all others
+"bB" : "route bB;bB;time"
+"bB" : "route bB;bB;route"
+"bB" : "route bB;bB;optimal"
+"bB" : "route bB;bB;all"
+
+"bB Aa" : "route bB;Aa;time"
+"bB Aa" : "route bB;Aa;route"
+"bB Aa" : "route bB;Aa;optimal"
+"bB Aa
+bB C Aa
+bB C d Aa" : "route bB;Aa;all"
+
+"bB C" : "route bB;C;time"
+"bB Aa C" : "route bB;C;route"
+"bB C" : "route bB;C;optimal"
+"bB Aa C
+bB Aa d C
+bB C" : "route bB;C;all"
+
+"bB C d" : "route bB;d;time"
+"bB Aa C d" : "route bB;d;route"
+"bB C d" : "route bB;d;optimal"
+"bB Aa C d
+bB Aa d
+bB C Aa d
+bB C d" : "route bB;d;all"
+
+#C to all others
+"C" : "route C;C;time"
+"C" : "route C;C;route"
+"C" : "route C;C;optimal"
+"C" : "route C;C;all"
+
+"C Aa" : "route C;Aa;time"
+"C Aa" : "route C;Aa;route"
+"C Aa" : "route C;Aa;optimal"
+"C Aa
+C bB Aa
+C d Aa" : "route C;Aa;all"
+
+"C bB" : "route C;bB;time"
+"C Aa bB" : "route C;bB;route"
+"C bB" : "route C;bB;optimal"
+"C Aa bB
+C bB
+C d Aa bB" : "route C;bB;all"
+
+"C d" : "route C;d;time"
+"C d" : "route C;d;route"
+"C d" : "route C;d;optimal"
+"C Aa d
+C bB Aa d
+C d" : "route C;d;all"
+
+#d to all others
+"d" : "route d;d;time"
+"d" : "route d;d;route"
+"d" : "route d;d;optimal"
+"d" : "route d;d;all"
+
+"d C Aa" : "route d;Aa;time"
+"d C Aa" : "route d;Aa;route"
+"d C Aa" : "route d;Aa;optimal"
+"d Aa
+d C Aa
+d C bB Aa" : "route d;Aa;all"
+
+"d C bB" : "route d;bB;time"
+"d C Aa bB" : "route d;bB;route"
+"d C bB" : "route d;bB;optimal"
+"d Aa bB
+d Aa C bB
+d C Aa bB
+d C bB" : "route d;bB;all"
+
+"d C" : "route d;C;time"
+"d C" : "route d;C;route"
+"d C" : "route d;C;optimal"
+"d Aa bB C
+d Aa C
+d C" : "route d;C;all"

Uni/Java/WS1516/Programmieren/Final01/bin/search.test

@@ -0,0 +1,78 @@
+<"C:\Eclipse\workspace\Final01\tests\test.graph">
+#55 Testcases
+#Errors
+00err : "search "
+00err : "search null;null;null"
+00err : "search null;null;null;null"
+00err : "search null;null;time"
+00err : "search null;null;route"
+00err : "search null;null;optimal"
+00err : "search ceee;deeee;optimal;"
+
+#Aa to all others
+0 : "search Aa;Aa;time"
+0 : "search Aa;Aa;route"
+0 : "search Aa;Aa;optimal"
+
+3 : "search Aa;bB;time"
+1 : "search Aa;bB;route"
+10 : "search Aa;bB;optimal"
+
+4 : "search Aa;C;time"
+2 : "search Aa;C;route"
+20 : "search Aa;C;optimal"
+
+5 : "search Aa;d;time"
+5 : "search Aa;d;route"
+50 : "search Aa;d;optimal"
+
+#bB to all others
+0 : "search bB;bB;time"
+0 : "search bB;bB;route"
+0 : "search bB;bB;optimal"
+
+3 : "search bB;Aa;time"
+1 : "search bB;Aa;route"
+10 : "search bB;Aa;optimal"
+
+2 : "search bB;C;time"
+3 : "search bB;C;route"
+29 : "search bB;C;optimal"
+
+3 : "search bB;d;time"
+6 : "search bB;d;route"
+73 : "search bB;d;optimal"
+
+#C to all others
+0 : "search C;C;time"
+0 : "search C;C;route"
+0 : "search C;C;optimal"
+
+4 : "search C;Aa;time"
+2 : "search C;Aa;route"
+20 : "search C;Aa;optimal"
+
+2 : "search C;bB;time"
+3 : "search C;bB;route"
+29 : "search C;bB;optimal"
+
+1 : "search C;d;time"
+3 : "search C;d;route"
+10 : "search C;d;optimal"
+
+#d to all others
+0 : "search d;d;time"
+0 : "search d;d;route"
+0 : "search d;d;optimal"
+
+5 : "search d;Aa;time"
+5 : "search d;Aa;route"
+50 : "search d;Aa;optimal"
+
+3 : "search d;bB;time"
+6 : "search d;bB;route"
+73 : "search d;bB;optimal"
+
+1 : "search d;C;time"
+3 : "search d;C;route"
+10 : "search d;C;optimal"

Uni/Java/WS1516/Programmieren/Final01/bin/test.graph

@@ -0,0 +1,10 @@
+Aa
+bB
+C
+d
+--
+Aa;bB;1;3
+Aa;C;2;4
+Aa;d;11;20
+bB;C;5;2
+C;d;3;1

Uni/Java/WS1516/Programmieren/Final01/bin/treeGraph.graph

@@ -0,0 +1,14 @@
+A
+B
+C
+D
+E
+F
+G
+--
+A;B;2;5
+A;C;100;2
+B;D;100;60
+B;E;300;20
+C;F;4;4
+C;G;20;6

Uni/Java/WS1516/Programmieren/Final01/bin/treeGraph.test

@@ -0,0 +1,80 @@
+<"C:\Eclipse\workspace\Final01\tests\treeGraph.graph">
+#Init test
+"A
+B
+C
+D
+E
+F
+G
+--
+A;B;2;5
+A;C;100;2
+B;D;100;60
+B;E;300;20
+C;F;4;4
+C;G;20;6" : "info"
+
+#Nodes
+"B
+C" : "nodes A"
+"A
+D
+E" : "nodes B"
+"A
+F
+G" : "nodes C"
+"B" : "nodes D"
+"B" : "nodes E"
+"C" : "nodes F"
+"C" : "nodes G"
+
+#Routes
+#From root
+"A B" : "route A;B;time"
+"A B" : "route A;B;route"
+"A B" : "route A;B;optimal"
+"A B" : "route A;B;all"
+5 : "search A;B;time"
+2 : "search A;B;route"
+29 : "search A;B;optimal"
+
+"A C" : "route A;C;time"
+"A C" : "route A;C;route"
+"A C" : "route A;C;optimal"
+"A C" : "route A;C;all"
+2 : "search A;C;time"
+100 : "search A;C;route"
+10004 : "search A;C;optimal"
+
+"A B D" : "route A;D;time"
+"A B D" : "route A;D;route"
+"A B D" : "route A;D;optimal"
+"A B D" : "route A;D;all"
+65 : "search A;D;time"
+102 : "search A;D;route"
+14629 : "search A;D;optimal"
+
+"A B E" : "route A;E;time"
+"A B E" : "route A;E;route"
+"A B E" : "route A;E;optimal"
+"A B E" : "route A;E;all"
+25 : "search A;E;time"
+302 : "search A;E;route"
+91829 : "search A;E;optimal"
+
+"A C F" : "route A;F;time"
+"A C F" : "route A;F;route"
+"A C F" : "route A;F;optimal"
+"A C F" : "route A;F;all"
+6 : "search A;F;time"
+104 : "search A;F;route"
+10852 : "search A;F;optimal"
+
+"A C G" : "route A;G;time"
+"A C G" : "route A;G;route"
+"A C G" : "route A;G;optimal"
+"A C G" : "route A;G;all"
+8 : "search A;G;time"
+120 : "search A;G;route"
+14464 : "search A;G;optimal"

Uni/Java/WS1516/Programmieren/Final01/bin/vertices.test

@@ -0,0 +1,21 @@
+<"C:\Eclipse\workspace\Final01\tests\test.graph">
+#Errors
+00err : "vertices null"
+00err : "vertices 10"
+
+#Standard
+"Aa
+bB
+C
+d" : "vertices"
+
+#Remove till empty
+"OK" : "remove C;bB"
+"OK" : "remove C;d"
+"OK" : "remove Aa;d"
+"OK" : "remove Aa;bB"
+"OK" : "remove Aa;C"
+
+#Empty output
+"
+" : "vertices"