项目作者: R1NC

项目描述 :
Implementations of data structures & algorithms written in Golang.
高级语言: Go
项目地址: git://github.com/R1NC/Go-Algorithm.git
创建时间: 2014-08-26T06:39:17Z
项目社区:https://github.com/R1NC/Go-Algorithm

开源协议:

下载


Data Structures:

  1. func spiralTraverse(m [][]string) {}
  1. func (list *LinkedList) Size() int {}
  2. func (list *LinkedList) Reverse() {}
  3. func (list *LinkedList) IndexOf(value interface{}) int {}
  4. func (list *LinkedList) Get(index int) interface{} {}
  5. func (list *LinkedList) GetFirst() interface{} {}
  6. func (list *LinkedList) GetLast() interface{} {}
  7. func (list *LinkedList) Add(value interface{}, index int) {}
  8. func (list *LinkedList) AddToFirst(value interface{}) {}
  9. func (list *LinkedList) AddToLast(value interface{}) {}
  10. func (list *LinkedList) RemoveAt(index int) {}
  11. func (list *LinkedList) RemoveFirst() {}
  12. func (list *LinkedList) RemoveLast() {}
  1. func (stack *LinkedStack) Size() int {}
  2. func (stack *LinkedStack) Push(value interface{}) {}
  3. func (stack *LinkedStack) Pop() {}
  4. func (stack *LinkedStack) Peek() interface{} {}
  1. func (queue *LinkedQueue) Size() int {}
  2. func (queue *LinkedQueue) Add(value interface{}) {}
  3. func (queue *LinkedQueue) Remove() {}
  4. func (queue *LinkedQueue) Peek() interface{} {}
  1. func (hashMap *LinkedHashMap) Put(key int, value interface{}) {}
  2. func (hashMap *LinkedHashMap) Get(key int) interface{} {}
  3. func (hashMap *LinkedHashMap) Remove(key int) {}
  4. func (hashMap *LinkedHashMap) Clear() {}
  1. func (tree *BinarySearchTree) Add(value int) {}
  2. func (tree *BinarySearchTree) Remove(value int) {}
  3. func (tree *BinarySearchTree) Search(value int) *BinarySearchTree {}
  4. func (tree *BinarySearchTree) Traverse() {}
  5. func (tree *BinarySearchTree) TraverseByLevel() {}
  1. func (heap *BinaryHeap) Size() int {}
  2. func (heap *BinaryHeap) Add(data int) {}
  3. func (heap *BinaryHeap) RemoveMinimum() int {}
  1. func (graph *Graph) BreadthFirstSearch(startVertex *Vertex) {}
  2. func (graph *Graph) DepthFirstSearch(startVertex *Vertex) {}
  3. func (graph *Graph) PrimMinimumSpanningTree(startVertex *Vertex) {}
  4. func (graph *Graph) KruskalMinimumSpanningTree() {}
  5. func (graph *Graph) DijkstraShortestPath(startVertex *Vertex, endVertex *Vertex) {}
  6. func (graph *Graph) TopologicalSort() {}

Sorting Algorithms:

  1. func SimpleBubbleSort(array []int) {}
  2. func FlagSwapBubbleSort(array []int) {}
  3. func FlagSwapPositionBubbleSort(array []int) {}
  1. func InsertSort(array []int) {}
  1. func SelectSort(array []int) {}
  1. func QucikSort(array []int) {}

Searching Algorithms:

  1. func RecursionBinarySearch(sorted_array []int, target int) int {}
  2. func NonRecursionBinarySearch(sorted_array []int, target int) int {}

String Algorithms:

  1. func KMPSearch(source string, pattern string) int {}
  2. func BMSearch(source string, pattern string) int {}