MCPcopy Create free account

hub / github.com/algorithm-visualizer/algorithms / functions

Functions120 in github.com/algorithm-visualizer/algorithms

⨍ Functions 120◇ Types & classes 9
↓ 6 callersMethodfind
(element)
Uncategorized/Maze Generation/code.js:377
↓ 5 callersFunctionstringify
Uncategorized/K-Means Clustering/code.js:31
↓ 4 callersFunctionupdate
(i, j, value)
Dynamic Programming/Maximum Sum Path/code.js:26
↓ 3 callersFunctionfilledArray
(length, value)
Brute Force/PageRank/code.js:5
↓ 3 callersFunctiontestProbablyPrime
* Determine if N is prime using Miller-Rabin probabilistic algorithm * @param {Number} n The number * @param {Number} k An integer that determine
Uncategorized/Miller-Rabin's Primality Test/code.js:49
↓ 3 callersFunctiontrace
(v)
Brute Force/Bridge Finding/efficient.js:55
↓ 2 callersFunctionallowImprove
()
Uncategorized/K-Means Clustering/code.js:91
↓ 2 callersFunctioncipher
(str, rotation, direction, cipherTracer)
Uncategorized/Caesar Cipher/code.js:45
↓ 2 callersFunctioncluster
(data, centers)
Uncategorized/K-Means Clustering/code.js:43
↓ 2 callersFunctioncol
(a, i)
Uncategorized/K-Means Clustering/code.js:34
↓ 2 callersFunctiondigit
(i, exp)
Divide and Conquer/Radix Sort/leastSignificantDigit.js:31
↓ 2 callersFunctionfilledArray
(length, value)
Brute Force/Bridge Finding/efficient.js:114
↓ 2 callersFunctionflip
(start)
Brute Force/Pancake Sort/code.js:21
↓ 2 callersFunctionheapify
(array, size, root)
Brute Force/Heapsort/code.js:53
↓ 2 callersFunctioninit
(rank)
Greedy/Stable Matching/code.js:33
↓ 2 callersFunctionmean
Uncategorized/K-Means Clustering/code.js:35
↓ 2 callersMethodsetUnion
(_a, _b)
Uncategorized/Maze Generation/code.js:384
↓ 2 callersFunctionshuffle
(array)
Uncategorized/Maze Generation/code.js:411
↓ 1 callersFunctionBELLMAN_FORD
(src, dest)
Dynamic Programming/Bellman-Ford's Shortest Path/code.js:15
↓ 1 callersFunctionBFS
()
Brute Force/Breadth-First Search/shortestPath.js:15
↓ 1 callersFunctionBFS
(s)
Brute Force/Breadth-First Search/tree.js:29
↓ 1 callersFunctionBFSCheckBipartiteness
(s)
Brute Force/Bipartiteness Test/code.js:23
↓ 1 callersFunctionBinarySearch
(array, element)
Branch and Bound/Binary Search/iterative.js:16
↓ 1 callersFunctionBinarySearch
(array, element, minIndex, maxIndex)
Branch and Bound/Binary Search/recursive.js:16
↓ 1 callersFunctionBubbleSort
Brute Force/Bubble Sort/main.cpp:22
↓ 1 callersFunctionCellularAutomata
(fillShape, emptyShape)
Simple Recursive/Cellular Automata/code.js:41
↓ 1 callersFunctionDFS
(node, parent, weight)
Brute Force/Depth-First Search/shortestPath.js:15
↓ 1 callersFunctionDFS
(node, parent, weight)
Brute Force/Depth-First Search/weightedGraph.js:17
↓ 1 callersFunctionDFS
(node, parent)
Brute Force/Depth-First Search/tree.js:29
↓ 1 callersFunctionDFSExplore
(graph, source)
Brute Force/Bridge Finding/naive.js:23
↓ 1 callersFunctionDFSExplore
(graph, source)
Brute Force/Depth-First Search/graph.js:16
↓ 1 callersFunctionDLSCount
(limit, node, parent)
Branch and Bound/Depth-Limited Search/code.js:31
↓ 1 callersFunctionDijkstra
(start, end)
Greedy/Dijkstra's Shortest Path/code.js:21
↓ 1 callersFunctionFloodFill
(i, j, oldColor, newColor)
Brute Force/Flood Fill/code.js:24
↓ 1 callersFunctionFloydWarshall
()
Dynamic Programming/Floyd-Warshall's Shortest Path/code.js:15
↓ 1 callersFunctionFreivaldsAlgorithm
()
Uncategorized/Freivalds' Matrix-Multiplication Verification/code.js:23
↓ 1 callersFunctionKMP
(string, pattern)
Dynamic Programming/Knuth-Morris-Pratt's String Search/code.js:59
↓ 1 callersFunctionSCCVertex
(u, disc, low, st, stackMember, carry)
Brute Force/Tarjan's Strongly Connected Components/code.js:42
↓ 1 callersMethodaddElements
(numberOfElements)
Uncategorized/Maze Generation/code.js:370
↓ 1 callersFunctionareCentersEqual
(c1, c2)
Uncategorized/K-Means Clustering/code.js:41
↓ 1 callersFunctionarraySum
(array)
Brute Force/PageRank/code.js:37
↓ 1 callersFunctionarrayify
Uncategorized/K-Means Clustering/code.js:30
↓ 1 callersFunctionbst
(item, node, parent)
Branch and Bound/Binary Search Tree/search.js:44
↓ 1 callersFunctionbstInsert
(root, element, parent)
Branch and Bound/Binary Search Tree/insertion.js:19
↓ 1 callersFunctionbuildMaze
()
Uncategorized/Maze Generation/code.js:66
↓ 1 callersFunctionchooseRandomCenters
(data, k)
Uncategorized/K-Means Clustering/code.js:28
↓ 1 callersFunctioncleanUpEndLocation
(end)
Uncategorized/Maze Generation/code.js:282
↓ 1 callersFunctioncleanUpGrid
(width, height)
Uncategorized/Maze Generation/code.js:297
↓ 1 callersFunctioncleanUpStartLocation
(start)
Uncategorized/Maze Generation/code.js:267
↓ 1 callersMethodcompareSize
(a, b)
Uncategorized/Maze Generation/code.js:400
↓ 1 callersFunctioncopy
(mergeFrom, mergeTo, start, end)
Divide and Conquer/Merge Sort/bottomUp.js:111
↓ 1 callersFunctioncreateZarr
(concat)
Dynamic Programming/Z String Search/code.js:28
↓ 1 callersFunctioncryptAlpha
(alpha)
Uncategorized/Affine Cipher/code.js:31
↓ 1 callersFunctiondecrypt
(str, rotation)
Uncategorized/Caesar Cipher/code.js:94
↓ 1 callersFunctiondecrypt
(cypherText)
Uncategorized/Affine Cipher/code.js:68
↓ 1 callersFunctiondecryptAlpha
(alpha)
Uncategorized/Affine Cipher/code.js:82
↓ 1 callersFunctiondistance
([x1, y1], [x2, y2])
Uncategorized/K-Means Clustering/code.js:32
↓ 1 callersFunctionencrypt
(str, rotation)
Uncategorized/Caesar Cipher/code.js:87
↓ 1 callersFunctionencrypt
(plainText)
Uncategorized/Affine Cipher/code.js:28
↓ 1 callersFunctionextractUnstable
(Q)
Greedy/Stable Matching/code.js:45
↓ 1 callersFunctionfact
(num)
Simple Recursive/Nth Factorial/code.js:17
↓ 1 callersFunctionfindBridges
(graph)
Brute Force/Bridge Finding/naive.js:50
↓ 1 callersFunctionfindMajorityElement
()
Greedy/Boyer–Moore's Majority Vote/code.js:108
↓ 1 callersFunctionfindProbableElement
()
Greedy/Boyer–Moore's Majority Vote/code.js:49
↓ 1 callersFunctionfindUnsortedSubarray
(nums)
Uncategorized/Shortest Unsorted Continuous Subarray/code.js:14
↓ 1 callersFunctiongetNextChar
(currChar, direction)
Uncategorized/Caesar Cipher/code.js:34
↓ 1 callersFunctiongetPosDown
(pos)
Uncategorized/Caesar Cipher/code.js:30
↓ 1 callersFunctiongetPosUp
(pos)
Uncategorized/Caesar Cipher/code.js:26
↓ 1 callersFunctionget_next
(pattern)
Dynamic Programming/Knuth-Morris-Pratt's String Search/code.js:16
↓ 1 callersMethodham
(int k)
Backtracking/Hamiltonean Cycles/Code.java:17
↓ 1 callersFunctionheapSort
(array, size)
Brute Force/Heapsort/code.js:20
↓ 1 callersFunctioninOrder
(root, parent)
Brute Force/Binary Tree Traversal/inOrder.js:46
↓ 1 callersFunctionintegerPartition
(n)
Dynamic Programming/Integer Partition/code.js:31
↓ 1 callersFunctionisMajorityElement
(element)
Greedy/Boyer–Moore's Majority Vote/code.js:16
↓ 1 callersFunctionknightTour
(x, y, moveNum)
Backtracking/Knight's Tour Problem/code.js:41
↓ 1 callersFunctionkruskal
()
Greedy/Kruskal's Minimum Spanning Tree/code.js:21
↓ 1 callersFunctionlcaBT
(parent, root, a, b)
Brute Force/Lowest Common Ancestor/code.js:42
↓ 1 callersFunctionlistHasCycle
(head)
Simple Recursive/Cycle Detection/code.js:50
↓ 1 callersFunctionmax
(a, b)
Dynamic Programming/Longest Palindromic Subsequence/code.js:30
↓ 1 callersFunctionmerge
(mergeFrom, start, middle, end, mergeTo)
Divide and Conquer/Merge Sort/bottomUp.js:50
↓ 1 callersFunctionmergeSort
(start, end)
Divide and Conquer/Merge Sort/topDown.js:20
↓ 1 callersFunctionmergeSort
(start, end)
Divide and Conquer/Merge Sort/bottomUp.js:22
↓ 1 callersFunctionnQ
(currentQueen, currentCol)
Backtracking/N-Queens Problem/code.js:43
↓ 1 callersMethodnextVal
(int k)
Backtracking/Hamiltonean Cycles/Code.java:39
↓ 1 callersFunctionpartition
(A, n, p)
Dynamic Programming/Integer Partition/code.js:21
↓ 1 callersFunctionpartition
(D, low, high)
Divide and Conquer/Quicksort/code.js:20
↓ 1 callersFunctionpostOrder
(root, parent)
Brute Force/Binary Tree Traversal/postOrder.js:46
↓ 1 callersFunctionpow
(base, expo)
Divide and Conquer/Radix Sort/leastSignificantDigit.js:23
↓ 1 callersFunctionpower
(x, y, p)
Uncategorized/Miller-Rabin's Primality Test/code.js:29
↓ 1 callersFunctionpreOrder
(root, parent)
Brute Force/Binary Tree Traversal/preOrder.js:46
↓ 1 callersFunctionprim
()
Greedy/Prim's Minimum Spanning Tree/code.js:22
↓ 1 callersMethodquickSort
(Integer[] arr, int left, int right)
Divide and Conquer/Quicksort/Code.java:26
↓ 1 callersFunctionquicksort
(D)
Divide and Conquer/Quicksort/code.js:76
↓ 1 callersFunctionreCalculateCenters
Uncategorized/K-Means Clustering/code.js:40
↓ 1 callersFunctionrecenterAndCluster
(originalClusters)
Uncategorized/K-Means Clustering/code.js:84
↓ 1 callersFunctionselectSuffix
(word, i)
Simple Recursive/Suffix Array/code.js:32
↓ 1 callersFunctionshowOutgoingEdges
(i)
Brute Force/PageRank/code.js:45
↓ 1 callersFunctionshuffle
Uncategorized/K-Means Clustering/code.js:14
↓ 1 callersMethodsolve
()
Backtracking/Sum of subsets/Code.java:17
↓ 1 callersFunctionsum
(x, y)
Uncategorized/K-Means Clustering/code.js:27
next →1–100 of 120, ranked by callers