FazBrowse GitHub Viewer
|
Trending
|
URL:
|
Home
Tools:
[Download Repo ZIP]
[View Raw Code]
[Original HTTPS Page]
AlgorithmVisualizer/algorithm/category.json at master · thydev/AlgorithmVisualizer · GitHub
thydev
/
AlgorithmVisualizer
Public
forked from
algorithm-visualizer/algorithm-visualizer
Notifications
You must be signed in to change notification settings
Fork
0
Star
0
Code
Pull requests
0
Actions
Projects
Wiki
Security and quality
0
Insights
Additional navigation options
Code
Pull requests
Actions
Projects
Wiki
Security and quality
Insights
Expand file tree
Breadcrumbs
AlgorithmVisualizer
/
algorithm
/
category.json
Copy path
More file actions
More file actions
Latest commit
History
History
History
110 lines (110 loc) · 2.9 KB
Breadcrumbs
AlgorithmVisualizer
/
algorithm
/
category.json
Copy path
File metadata and controls
110 lines (110 loc) · 2.9 KB
Raw
Copy raw file
Download raw file
Open symbols panel
Edit and raw actions
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
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
{
"backtracking"
: {
"list"
: {
"n_queens"
:
"
N Queens Problem
"
},
"name"
:
"
Backtracking
"
},
"cryptography"
: {
"list"
: {
"affine_cipher"
:
"
Affine Cipher
"
,
"caesar_cipher"
:
"
Caesar Cipher
"
},
"name"
:
"
Cryptography
"
},
"dp"
: {
"list"
: {
"catalan_number"
:
"
Catalan Number
"
,
"fibonacci"
:
"
Fibonacci Sequence
"
,
"integer_partition"
:
"
Integer Partition
"
,
"knapsack_problem"
:
"
Knapsack Problem
"
,
"longest_increasing_subsequence"
:
"
Longest Increasing Subsequence
"
,
"max_subarray"
:
"
Maximum Subarray
"
,
"max_sum_path"
:
"
Maximum Sum Path
"
,
"pascal_triangle"
:
"
Pascal's Triangle
"
,
"sliding_window"
:
"
Sliding Window
"
,
"ugly_numbers"
:
"
Ugly Numbers
"
},
"name"
:
"
Dynamic Programming
"
},
"graph_search"
: {
"list"
: {
"bellman_ford"
:
"
Bellman-Ford
"
,
"bfs"
:
"
BFS
"
,
"bridges"
:
"
Find-Bridges
"
,
"dfs"
:
"
DFS
"
,
"dijkstra"
:
"
Dijkstra
"
,
"floyd_warshall"
:
"
Floyd-Warshall
"
,
"page_rank"
:
"
PageRank Algorithm
"
,
"topological_sort"
:
"
Topological-Sort
"
},
"name"
:
"
Graph Search
"
},
"greedy"
: {
"list"
: {
"job_scheduling"
:
"
Job Scheduling Problem
"
},
"name"
:
"
Greedy
"
},
"mst"
: {
"list"
: {
"kruskal"
:
"
Kruskal's Algorithm
"
,
"prim"
:
"
Prim's Algorithm
"
},
"name"
:
"
Minimum Spanning Tree
"
},
"number_theory"
: {
"list"
: {
"euclidean_algorithm"
:
"
Euclidean Algorithm
"
,
"seive_of_erathrones"
:
"
Seive of Erathrones
"
},
"name"
:
"
Number Theory
"
},
"search"
: {
"list"
: {
"binary_search"
:
"
Binary Search
"
},
"name"
:
"
Search
"
},
"sorting"
: {
"list"
: {
"bubble"
:
"
Bubble Sort
"
,
"comb"
:
"
Comb Sort
"
,
"counting"
:
"
Counting Sort
"
,
"cycle"
:
"
Cycle Sort
"
,
"heap"
:
"
Heapsort
"
,
"insertion"
:
"
Insertion Sort
"
,
"merge"
:
"
Merge Sort
"
,
"quick"
:
"
Quicksort
"
,
"radix"
:
"
Radix Sort
"
,
"selection"
:
"
Selection Sort
"
,
"shell"
:
"
Shellsort
"
},
"name"
:
"
Sorting
"
},
"string"
: {
"list"
: {
"edit_distance"
:
"
Edit Distance
"
,
"knuth_morris_pratt"
:
"
KMP Substring Search
"
,
"rabin_karp_algorithm"
:
"
Rabin-Karp Algorithm
"
,
"suffix_array"
:
"
Suffix Array (construction & usage)
"
},
"name"
:
"
String
"
},
"tree"
: {
"list"
: {
"binary_search_tree"
:
"
Binary Search Tree
"
,
"binary_tree_traversal"
:
"
Binary Tree Traversal
"
,
"lowest_common_ancestor"
:
"
Lowest Common Ancestor
"
},
"name"
:
"
Tree
"
},
"etc"
: {
"list"
: {
"flood_fill"
:
"
Flood Fill
"
,
"cellular_automata"
:
"
Cellular Automata
"
,
"create_maze"
:
"
Create Maze
"
},
"name"
:
"
Uncategorized
"
}
}
Back
|
FazBrowse Home
|
New Git URL