Graphen und Graphenalgorithmen: Revision history

8 July 2014

• curprev 12:2412:24, 8 July 2014‎ Alda talk contribs‎ 130,545 bytes +106‎ →‎Algorithmus 2
• curprev 10:2110:21, 8 July 2014‎ Alda talk contribs‎ 130,439 bytes −12‎ →‎Algorithmus von Prim

30 July 2012

• curprev 15:2815:28, 30 July 2012‎ Alda talk contribs‎ 130,451 bytes −1‎ →‎Tiefensuche in Graphen (Depth First Search, DFS)

28 July 2012

• curprev 18:3618:36, 28 July 2012‎ Alda talk contribs‎ 130,452 bytes −1‎ →‎Tiefensuche in Graphen (Depth First Search, DFS)

25 July 2012

• curprev 19:3819:38, 25 July 2012‎ Ukoethe talk contribs‎ 130,453 bytes +122‎ →‎Transitive Hülle und stark zusammenhängende Komponenten
• curprev 19:1619:16, 25 July 2012‎ Ukoethe talk contribs‎ 130,331 bytes 0‎ →‎Transitive Hülle und stark zusammenhängende Komponenten
• curprev 19:1219:12, 25 July 2012‎ Ukoethe talk contribs‎ 130,331 bytes −1‎ →‎Transitive Hülle und stark zusammenhängende Komponenten
• curprev 19:1119:11, 25 July 2012‎ Ukoethe talk contribs‎ 130,332 bytes +1‎ →‎Transitive Hülle und stark zusammenhängende Komponenten
• curprev 19:0919:09, 25 July 2012‎ Ukoethe talk contribs‎ 130,331 bytes 0‎ →‎Algorithmus 2
• curprev 19:0419:04, 25 July 2012‎ Ukoethe talk contribs‎ 130,331 bytes +5‎ →‎Algorithmus 2
• curprev 19:0219:02, 25 July 2012‎ Ukoethe talk contribs‎ 130,326 bytes −1‎ →‎Algorithmus 2
• curprev 18:5618:56, 25 July 2012‎ Ukoethe talk contribs‎ 130,327 bytes 0‎ →‎Das Erfüllbarkeitsproblem
• curprev 14:3314:33, 25 July 2012‎ Ukoethe talk contribs‎ 130,327 bytes −4‎ →‎Lösung des 2-SAT-Problems mit Implikationgraphen
• curprev 14:3314:33, 25 July 2012‎ Ukoethe talk contribs‎ 130,331 bytes +10‎ →‎Lösung des 2-SAT-Problems mit Implikationgraphen

24 July 2012

• curprev 20:3520:35, 24 July 2012‎ Ukoethe talk contribs‎ 130,321 bytes +2‎ →‎Lösung des 2-SAT-Problems mit Implikationgraphen
• curprev 20:3420:34, 24 July 2012‎ Ukoethe talk contribs‎ 130,319 bytes +307‎ →‎Normalformen für logische Ausdrücke
• curprev 20:1020:10, 24 July 2012‎ Ukoethe talk contribs‎ 130,012 bytes +72‎ →‎Algorithmen für gerichtete Graphen
• curprev 20:0820:08, 24 July 2012‎ Ukoethe talk contribs‎ 129,940 bytes −26‎ →‎Algorithmen für gerichtete Graphen
• curprev 20:0820:08, 24 July 2012‎ Ukoethe talk contribs‎ 129,966 bytes +100‎ →‎Algorithmen für gerichtete Graphen
• curprev 20:0620:06, 24 July 2012‎ Ukoethe talk contribs‎ 129,866 bytes +1,541‎ →‎Algorithmus von Kruskal
• curprev 17:0617:06, 24 July 2012‎ Stephan.meister talk contribs‎ 128,325 bytes 0‎ fixed depth first search function with parents list

22 July 2012

• curprev 16:0916:09, 22 July 2012‎ Ukoethe talk contribs‎ 128,325 bytes +5‎ →‎Weitere wichtige Graphenalgorithmen
• curprev 16:0716:07, 22 July 2012‎ Ukoethe talk contribs‎ 128,320 bytes +47‎ →‎Weitere wichtige Graphenalgorithmen
• curprev 16:0616:06, 22 July 2012‎ Ukoethe talk contribs‎ 128,273 bytes +1,809‎ →‎Lösung des 2-SAT-Problems mit Implikationgraphen
• curprev 15:2915:29, 22 July 2012‎ Ukoethe talk contribs‎ 126,464 bytes +1,287‎ →‎Weitere wichtige Graphenalgorithmen
• curprev 15:0115:01, 22 July 2012‎ Ukoethe talk contribs‎ 125,177 bytes +3‎ →‎Das Erfüllbarkeitsproblem
• curprev 14:5914:59, 22 July 2012‎ Ukoethe talk contribs‎ 125,174 bytes +3‎ No edit summary
• curprev 14:5614:56, 22 July 2012‎ Ukoethe talk contribs‎ 125,171 bytes −7,828‎ →‎Problem des Handlungsreisenden
• curprev 14:5114:51, 22 July 2012‎ Ukoethe talk contribs‎ 132,999 bytes −4,400‎ →‎Erfüllbarkeitsproblem
• curprev 14:4914:49, 22 July 2012‎ Ukoethe talk contribs‎ 137,399 bytes +247‎ →‎Normalformen für logische Ausdrücke
• curprev 14:4714:47, 22 July 2012‎ Ukoethe talk contribs‎ 137,152 bytes +1,251‎ →‎Lösung des 2-SAT-Problems mit Implikationgraphen
• curprev 14:2814:28, 22 July 2012‎ Ukoethe talk contribs‎ 135,901 bytes −2‎ →‎Normalformen für logische Ausdrücke
• curprev 14:2714:27, 22 July 2012‎ Ukoethe talk contribs‎ 135,903 bytes −187‎ →‎Anwendung auf 2-SAT Problem
• curprev 14:2714:27, 22 July 2012‎ Ukoethe talk contribs‎ 136,090 bytes +1,316‎ →‎Lösung des 2-SAT-Problems mit Implikationgraphen
• curprev 14:2614:26, 22 July 2012‎ Ukoethe talk contribs‎ 134,774 bytes +66‎ →‎Das Erfüllbarkeitsproblem
• curprev 14:0114:01, 22 July 2012‎ Ukoethe talk contribs‎ 134,708 bytes −191‎ →‎Naive Lösung
• curprev 14:0114:01, 22 July 2012‎ Ukoethe talk contribs‎ 134,899 bytes −2,272‎ →‎Normalformen von logischen Ausdrücken
• curprev 13:5913:59, 22 July 2012‎ Ukoethe talk contribs‎ 137,171 bytes +87‎ →‎Das Erfüllbarkeitsproblem
• curprev 13:5613:56, 22 July 2012‎ Ukoethe talk contribs‎ 137,084 bytes +446‎ →‎Normalformen für logische Ausdrücke
• curprev 13:0913:09, 22 July 2012‎ Ukoethe talk contribs‎ 136,638 bytes +4‎ →‎Das Erfüllbarkeitsproblem
• curprev 13:0713:07, 22 July 2012‎ Ukoethe talk contribs‎ 136,634 bytes +4,556‎ →‎Das Erfüllbarkeitsproblem

21 July 2012

• curprev 15:4915:49, 21 July 2012‎ Ukoethe talk contribs‎ 132,078 bytes +6,525‎ →‎Anwendung: Implikationengraphen
• curprev 14:0414:04, 21 July 2012‎ Ukoethe talk contribs‎ 125,553 bytes +41‎ →‎Transitive Hülle und stark zusammenhängende Komponenten
• curprev 14:0314:03, 21 July 2012‎ Ukoethe talk contribs‎ 125,512 bytes +141‎ →‎Transitive Hülle und stark zusammenhängende Komponenten
• curprev 14:0014:00, 21 July 2012‎ Ukoethe talk contribs‎ 125,371 bytes +7‎ →‎Transitive Hülle und stark zusammenhängende Komponenten
• curprev 12:2712:27, 21 July 2012‎ Ukoethe talk contribs‎ 125,364 bytes 0‎ →‎Test, ob ein ungerichteter Graph azyklisch ist
• curprev 12:2712:27, 21 July 2012‎ Ukoethe talk contribs‎ 125,364 bytes 0‎ →‎Breitensuche in Graphen (Breadth First Search, BFS)
• curprev 12:2612:26, 21 July 2012‎ Ukoethe talk contribs‎ 125,364 bytes 0‎ →‎Tiefensuche in Graphen (Depth First Search, DFS)
• curprev 12:2512:25, 21 July 2012‎ Ukoethe talk contribs‎ 125,364 bytes +61‎ →‎Repräsentation von Graphen

20 July 2012

• curprev 19:1319:13, 20 July 2012‎ Ukoethe talk contribs‎ 125,303 bytes −3,408‎ →‎Stark zusammenhängende Komponenten
• curprev 19:0819:08, 20 July 2012‎ Ukoethe talk contribs‎ 128,711 bytes −29‎ →‎Transitive Hülle und stark zusammenhängende Komponenten
• curprev 17:2217:22, 20 July 2012‎ Ukoethe talk contribs‎ 128,740 bytes +22‎ →‎Algorithmus 2
• curprev 17:1917:19, 20 July 2012‎ Ukoethe talk contribs‎ 128,718 bytes −3‎ →‎Transitive Hülle und stark zusammenhängende Komponenten
• curprev 17:1117:11, 20 July 2012‎ Ukoethe talk contribs‎ 128,721 bytes +3,629‎ →‎Stark zusammenhängende Komponenten
• curprev 16:5716:57, 20 July 2012‎ Ukoethe talk contribs‎ 125,092 bytes +5‎ →‎Repräsentation von Graphen
• curprev 15:3915:39, 20 July 2012‎ Ukoethe talk contribs‎ 125,087 bytes +73‎ →‎Algorithmus 2
• curprev 15:3615:36, 20 July 2012‎ Ukoethe talk contribs‎ 125,014 bytes +1‎ →‎Anwendung: Abhängigkeitsgraph
• curprev 15:3515:35, 20 July 2012‎ Ukoethe talk contribs‎ 125,013 bytes 0‎ →‎Anwendung: Abhängigkeitsgraph
• curprev 13:3813:38, 20 July 2012‎ Ukoethe talk contribs‎ 125,013 bytes 0‎ →‎Algorithmus 2
• curprev 13:3813:38, 20 July 2012‎ Ukoethe talk contribs‎ 125,013 bytes +48‎ →‎Algorithmus 2
• curprev 13:3513:35, 20 July 2012‎ Ukoethe talk contribs‎ 124,965 bytes +1‎ →‎Algorithmus 1
• curprev 13:3413:34, 20 July 2012‎ Ukoethe talk contribs‎ 124,964 bytes +44‎ →‎Algorithmus 2
• curprev 12:3812:38, 20 July 2012‎ Ukoethe talk contribs‎ 124,920 bytes +5,349‎ →‎Algorithmus 2
• curprev 11:0911:09, 20 July 2012‎ Ukoethe talk contribs‎ 119,571 bytes +35‎ →‎Tiefensuche in Graphen (Depth First Search, DFS)
• curprev 10:5910:59, 20 July 2012‎ Ukoethe talk contribs‎ 119,536 bytes +5‎ →‎Algorithmus 1
• curprev 10:5810:58, 20 July 2012‎ Ukoethe talk contribs‎ 119,531 bytes −4‎ →‎Algorithmus 1
• curprev 10:5710:57, 20 July 2012‎ Ukoethe talk contribs‎ 119,535 bytes +2,224‎ →‎Algorithmus 1

19 July 2012

• curprev 22:4822:48, 19 July 2012‎ Ukoethe talk contribs‎ 117,311 bytes −324‎ →‎Anwendung: Abhängigkeitsgraph
• curprev 22:4222:42, 19 July 2012‎ Ukoethe talk contribs‎ 117,635 bytes −7‎ →‎Algorithmus 2
• curprev 22:3922:39, 19 July 2012‎ Ukoethe talk contribs‎ 117,642 bytes +1,547‎ →‎Algorithmus 2
• curprev 22:2322:23, 19 July 2012‎ Ukoethe talk contribs‎ 116,095 bytes +18‎ →‎Algorithmus 1
• curprev 22:2222:22, 19 July 2012‎ Ukoethe talk contribs‎ 116,077 bytes −1‎ →‎Anwendung: Abhängigkeitsgraph
• curprev 22:2122:21, 19 July 2012‎ Ukoethe talk contribs‎ 116,078 bytes +3‎ →‎Anwendung: Abhängigkeitsgraph
• curprev 22:2022:20, 19 July 2012‎ Ukoethe talk contribs‎ 116,075 bytes +1,622‎ →‎Algorithmen für gerichtete Graphen
• curprev 20:5520:55, 19 July 2012‎ Ukoethe talk contribs‎ 114,453 bytes +4,576‎ →‎Algorithmen für gerichtete Graphen
• curprev 19:1719:17, 19 July 2012‎ Ukoethe talk contribs‎ 109,877 bytes 0‎ →‎Repräsentation von Graphen
• curprev 19:1519:15, 19 July 2012‎ Ukoethe talk contribs‎ 109,877 bytes +28‎ →‎Repräsentation von Graphen
• curprev 18:5718:57, 19 July 2012‎ Ukoethe talk contribs‎ 109,849 bytes +6,224‎ →‎Algorithmen für gerichtete Graphen
• curprev 18:5018:50, 19 July 2012‎ Ukoethe talk contribs‎ 103,625 bytes +69‎ →‎Problem des Handlungsreisenden

18 July 2012

• curprev 21:4321:43, 18 July 2012‎ Ukoethe talk contribs‎ 103,556 bytes 0‎ →‎Algorithmus von Kruskal
• curprev 21:4221:42, 18 July 2012‎ Ukoethe talk contribs‎ 103,556 bytes −1‎ →‎Algorithmus von Kruskal
• curprev 21:4121:41, 18 July 2012‎ Ukoethe talk contribs‎ 103,557 bytes +5‎ →‎Algorithmus von Kruskal
• curprev 21:4121:41, 18 July 2012‎ Ukoethe talk contribs‎ 103,552 bytes +3,065‎ →‎Algorithmen
• curprev 14:0214:02, 18 July 2012‎ Ukoethe talk contribs‎ 100,487 bytes +358‎ →‎Motivation -- Königsberger Brückenproblem
• curprev 13:5513:55, 18 July 2012‎ Ukoethe talk contribs‎ 100,129 bytes +645‎ →‎Minimaler Spannbaum
• curprev 13:2913:29, 18 July 2012‎ Ukoethe talk contribs‎ 99,484 bytes −203‎ →‎A*-Algorithmus - Wie kann man Dijkstra noch verbessern?
• curprev 13:2913:29, 18 July 2012‎ Ukoethe talk contribs‎ 99,687 bytes +202‎ →‎Minimaler Spannbaum
• curprev 12:4712:47, 18 July 2012‎ Ukoethe talk contribs‎ 99,485 bytes 0‎ →‎A*-Algorithmus - Wie kann man Dijkstra noch verbessern?
• curprev 12:4312:43, 18 July 2012‎ Ukoethe talk contribs‎ 99,485 bytes +2,098‎ →‎A*-Algorithmus - Wie kann man Dijkstra noch verbessern?
• curprev 11:1311:13, 18 July 2012‎ Ukoethe talk contribs‎ 97,387 bytes +1,013‎ →‎A*-Algorithmus - Wie kann man Dijkstra noch verbessern?
• curprev 11:0311:03, 18 July 2012‎ Ukoethe talk contribs‎ 96,374 bytes −576‎ →‎Beispiel
• curprev 11:0211:02, 18 July 2012‎ Ukoethe talk contribs‎ 96,950 bytes +1,237‎ →‎Komplexität von Dijkstra

17 July 2012

• curprev 22:0822:08, 17 July 2012‎ Ukoethe talk contribs‎ 95,713 bytes +10‎ →‎Korrektheit von Dijkstra
• curprev 22:0522:05, 17 July 2012‎ Ukoethe talk contribs‎ 95,703 bytes +29‎ →‎Komplexität von Dijkstra
• curprev 22:0122:01, 17 July 2012‎ Ukoethe talk contribs‎ 95,674 bytes −3‎ →‎Algorithmus
• curprev 21:5321:53, 17 July 2012‎ Ukoethe talk contribs‎ 95,677 bytes +2,049‎ →‎Korrektheit von Dijkstra
• curprev 20:5120:51, 17 July 2012‎ Ukoethe talk contribs‎ 93,628 bytes +2‎ →‎Indirekter Beweis
• curprev 20:5020:50, 17 July 2012‎ Ukoethe talk contribs‎ 93,626 bytes −3‎ →‎Algorithmus
• curprev 20:4920:49, 17 July 2012‎ Ukoethe talk contribs‎ 93,629 bytes +3‎ →‎Algorithmus
• curprev 20:4820:48, 17 July 2012‎ Ukoethe talk contribs‎ 93,626 bytes +1‎ →‎Algorithmus