Main Page: Difference between revisions

From Algowiki
Jump to navigation Jump to search
Line 117: Line 117:
=== Flow Algorithms ===
=== Flow Algorithms ===
* [[Ford-Fulkerson]]
* [[Ford-Fulkerson]]
=== Data Structures ===
== Abstract Data Structures ==
*[[Network Structures]]
**[[Graph]]
**[[Tree]]
*[[Sequence]]
**[[Sorted Sequence]]
**[[Bounded priority queue]]
**[[Linear sequence]]
**[[Priority Queue]]
**[[Sorted sequence]]
=== Implementations of Abstract Data Structures ===
* [[Linked List]]
* [[Linked List]]
* [[Array List]]
* [[Array List]]
* [[Binary Search Tree]]
* [[Double Linked List]]
* [[Heap as array]] (DONE (Heap as Array))
* [[Hashtable]]
* [[Multi-way search tree]]
* [[Red-Black tree]]
* [[B-tree]]
=== ??? ===
* [[Min-Max Heaps]]
* [[First In - First Out]]
* [[First In - First Out]]
* [[First In - Ieast Out]]
* [[First In - Ieast Out]]
* [[Double Linked List]]
* [[Heaps]] (DONE (Heap as Array))
* [[Min-Max Heaps]]
* [[Hash Table]]
* [[Directed Tree]]
* [[Directed Tree]]
* [[Binary Search Tree]]
* [[B-Trees]]
* [[Decision Tree]]
* [[Decision Tree]]
* [[Red-Black Tree]]
* [[Graphs]]


=== Other Algorithms (LOCKED) ===
=== Other Algorithms (LOCKED) ===

Revision as of 08:20, 5 October 2014

News

Rules

  • Add finalized reconstructions of the old Wiki to Category:Checkup.
  • Don't any non-Weihe content until the reconstructions isn't finished.
  • Keep your active reconstructing Pages in "Division of labor" section up to date!

Divison of labor

  • Fabio Cuozzo - Problems on Sequences
  • Daniel Kratschmann - Problems
  • Jan Hohmann - B-Tree
  • Jan Rathjens - Ford-Fulkerson
  • Thomas Lautenschläger - ???

Page Status

Final: Category:Checkup

To Do

Notations

Problems

Coding Basics

String Matching Algorithms

Sorting Algorithms

Search Algorithms

Tree Algorithms

Graph Theory

Graph Algorithms

Flow Algorithms

Abstract Data Structures

Implementations of Abstract Data Structures

???

Other Algorithms (LOCKED)

Other Data Structures (LOCKED)