forked from algorithm-visualizer/algorithm-visualizer
-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathcategory.json
More file actions
65 lines (65 loc) · 1.48 KB
/
category.json
File metadata and controls
65 lines (65 loc) · 1.48 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
{
"graph_search": {
"name": "Graph Search",
"list": {
"dfs": "DFS",
"bfs": "BFS",
"dijkstra": "Dijkstra",
"bellman_ford": "Bellman-Ford",
"floyd_warshall": "Floyd-Warshall",
"topological_sort": "Topological-Sort",
"bridges": "Find-Bridges"
}
},
"mst": {
"name": "Minimum Spanning Tree",
"list": {
"prim": "Prim's Algorithm",
"kruskal": "Kruskal's Algorithm"
}
},
"search": {
"name": "Search",
"list": {
"binary_search": "Binary Search"
}
},
"sorting": {
"name": "Sorting",
"list": {
"insertion": "Insertion Sort",
"selection": "Selection Sort",
"bubble": "Bubble Sort",
"merge": "Merge Sort",
"radix": "Radix Sort",
"quick": "Quicksort",
"heap" : "Heapsort",
"shell": "Shellsort"
}
},
"string": {
"name": "String",
"list": {
"edit_distance": "Edit Distance",
"knuth_morris_pratt": "KMP Substring Search"
}
},
"dp": {
"name": "Dynamic Programming",
"list": {
"fibonacci": "Fibonacci Sequence",
"knapsack_problem": "Knapsack Problem",
"longest_increasing_subsequence": "Longest Increasing Subsequence",
"max_subarray": "Maximum Subarray",
"max_sum_path": "Maximum Sum Path",
"sliding_window": "Sliding Window",
"integer_partition": "Integer Partition"
}
},
"etc": {
"name": "Uncategorized",
"list": {
"flood_fill": "Flood Fill"
}
}
}