Skip to content

ALL-ROUND DataStructures with Demos 一个相对全面的数据结构C++实现

Notifications You must be signed in to change notification settings

XFeiF/DataStructures

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

33 Commits
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 

Repository files navigation

###Data Structures in C++

###For beginners:

Some Suggestions->see my blog

####Goal:

1. LinearList
    1. chain
        1. circulChainList
        2. doubleDirectionList
        3. singleChainList
    2. order
2. Stack
    1. chain
    2. order
3. Queue
    1. chain
    2. circul
    3. order
    4. priority
4. String
    1. chain
    2. order
5. StringSearching
6. Array
7. Tree
    1. BinarySearchTree
    2. BinaryTree
    3. HuffmanTree
    4. TrieTree
8. Graph
    1. AdjacencyList
    2. AdjacencyMatrix
9. Sort
    1. BubbleSort
    2. HeapSort
    3. InsertSort
    4. MergeSort
    5. QucikSort
    6. SelectionSort
    7. ShellSort
10. Heap

####Convention: 1. 每一类结构占一个文件夹 2. 每个子结构占一个子文件夹 3. 每种子结构有对应的功能测试文件xxxDemo.cpp ####TodoList:

####DoneList: 1. LinearList 2. Stack 3. Queue 4. String 5. StringSearching 6. Array 7. Tree 8. Graph 9. Sort

####Algorithms Included: Sort 1. BubbleSort 2. HeapSort 3. InsertSort 4. MergeSort 5. QucikSort 6. SelectionSort 7. ShellSort

Graph
    1. BFS
    2. DFS
    3. Minimum Spanning Tree  Kruskal
    4. Minimum Spanning Tree  Prim
    5. Shortest Path Dijkastra
    6. Shortest Path Floyd
    7. BinarySearchTree
    8. HuffmanTree
    9. KMP

####Attention:
UTF-8
C

About

ALL-ROUND DataStructures with Demos 一个相对全面的数据结构C++实现

Topics

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages