MCPcopy Create free account

hub / github.com/VAR-solutions/Algorithms / functions

Functions3,327 in github.com/VAR-solutions/Algorithms

⨍ Functions 3,327◇ Types & classes 712
↓ 2 callersFunctionupdateBIT
Updates a node in Binary Index Tree (BITree) at given index in BITree. The given value 'val' is added to BITree[i] and all of its ancestors in tree.
data structures/Fenwick_Tree.cpp:35
↓ 2 callersMethodusage
Searching/binary search/c/test/catch.hpp:4993
↓ 2 callersMethoduseColour
Searching/binary search/c/test/catch.hpp:4080
↓ 2 callersMethodwriteMatrix
(int[][] solution)
Backtracking/Sudoku solution/Java/Sudoku.java:62
↓ 1 callersMethodAppend
(value int)
heaps/BinomialHeap/Go/binomial_heap.go:121
↓ 1 callersFunctionArePair
Other Algorithms/balanced parentheses/cpp/balanced_parentheses.cpp:4
↓ 1 callersFunctionAreParenthesesBalanced
Other Algorithms/balanced parentheses/cpp/balanced_parentheses.cpp:11
↓ 1 callersMethodBFS
(self,s, t, parent)
Graphs/ford-fulkerson/python/max_flow.py:16
↓ 1 callersMethodBFS
Graphs/bfs/cpp/bfs.cpp:36
↓ 1 callersFunctionBSTToMinHeap
function to convert the given BST to MIN HEAP performs preorder traversal of the tree
Tree/Binary Search Tree/Bst to min heap.cpp:50
↓ 1 callersFunctionBinarySearch
Searching/binary search/cpp/binarySearch.cpp:3
↓ 1 callersFunctionBubbleSort
data structures/kth largest element/Biggest_Num_Bubble.cpp:6
↓ 1 callersFunctionBuildtree
Tree/Traverals/CPP/vertical order traversal.cpp:29
↓ 1 callersFunctionConstructQueue
data structures/queue/c/queue.c:31
↓ 1 callersFunctionCreate
data structures/linked list/c/MaxOfLinkedList.c:10
↓ 1 callersFunctionDFS
Sorting/Topological Sorting/C/topological_sorting.c:45
↓ 1 callersFunctionDFS
Graphs/dfs/c/dfs.c:33
↓ 1 callersMethodDFS
prints all not yet visited vertices reachable from s
Graphs/bfs/cpp/iterative_bfs.cpp:29
↓ 1 callersMethodDFS
(self,s)
Graphs/dfs/python/dfs.py:18
↓ 1 callersMethodDFS
DFS traversal of the vertices reachable from v. It uses recursive DFSUtil()
Graphs/dfs/cpp/dfs.cpp:56
↓ 1 callersMethodDFS
prints all not yet visited vertices reachable from s
Graphs/dfs/cpp/iterative_dfs.cpp:32
↓ 1 callersFunctionDFS_visit
Sorting/Topological Sorting/C/topological_sorting.c:24
↓ 1 callersMethodDFSrecur
(self,s,visited)
Graphs/dfs/python/dfs.py:11
↓ 1 callersFunctionDLLDelete
data structures/linked list/c/linked list.c:119
↓ 1 callersMethodDelete
(s string, parent *Node)
Tree/Binary Search Tree/go/src/bst.go:84
↓ 1 callersFunctionDestructQueue
data structures/queue/c/queue.c:47
↓ 1 callersFunctionEnqueue
data structures/queue/c/queue.c:56
↓ 1 callersFunctionEquals
Searching/binary search/c/test/catch.hpp:3115
↓ 1 callersMethodExtract
()
heaps/BinomialHeap/Go/binomial_heap.go:131
↓ 1 callersMethodFcfs
(process r[],int n)
Other Algorithms/Process Scheduling/java/process.java:261
↓ 1 callersFunctionFib
(n)
Dynamic Programming/fibonacci/python/fib.py:1
↓ 1 callersFunctionFibonacci
(n)
Other Algorithms/nth_fibonacci_number.py:5
↓ 1 callersMethodFind
find element
Tree/Binary Search Tree/go/src/bst.go:43
↓ 1 callersFunctionFindUnassignedLocation
Searches the grid to find an entry that is still unassigned. If found, the reference parameters row, col will be set the location that is unas
Backtracking/Sudoku solution/C/sudoku.c:52
↓ 1 callersFunctionFlippedCount
Bit Manipulation/FlipBits/flipbits.cpp:17
↓ 1 callersFunctionFlippedCount
(a , b)
Bit Manipulation/FlipBits/flipbits.py:12
↓ 1 callersMethodFordFulkerson
(self, source, sink)
Graphs/ford-fulkerson/python/max_flow.py:49
↓ 1 callersFunctionGnomeSort
(slice []int)
Sorting/Gnome Sort/Go/GnomeSort.go:7
↓ 1 callersFunctionGradientDescent
(inputValue, learningRate, precision, maximumIterations, gradientFunction)
Optimization/GradientDescent.py:1
↓ 1 callersMethodHighestVbyW
(int[] values, int[] weights)
Greedy Algorithms/Fractional Knapsack/java/Fractional_Knapsack.java:32
↓ 1 callersMethodInsert
insert into node
Tree/Binary Search Tree/go/src/bst.go:15
↓ 1 callersFunctionInsertionSort
Function to sort the elements of each bucket
Sorting/Bucket Sort/C/bucket_sort.c:83
↓ 1 callersFunctionKMPSearch
(pat, txt)
Other Algorithms/KMP/pyhton/kmpsearch.py:2
↓ 1 callersFunctionKnapSack
Dynamic Programming/knapsack/cpp/KnapSackDP.cpp:5
↓ 1 callersMethodKruskalMST
(self)
Graphs/Minimum Spanning Tree/python/MST_kruskal.py:48
↓ 1 callersMethodKruskalMST
()
Graphs/kruskal/Java/KruskalAlgo.java:76
↓ 1 callersMethodKthString
(int a[],int n,int k)
data structures/kth largest element/KthLargest.java:7
↓ 1 callersFunctionLCS
Recursive Algorithms/LCSRecursive/cpp/LCSRecursive.cpp:5
↓ 1 callersFunctionLCS
Dynamic Programming/LCSDP/Length-of-LCS-DP.cpp:9
↓ 1 callersFunctionLCS
Dynamic Programming/LCSDP/cpp/LCSDP.cpp:9
↓ 1 callersFunctionLongestCommonSubsequence
Dynamic Programming/common sub sequence/cpp/LCS.cpp:47
↓ 1 callersFunctionMatrixChainOrder
(p, n)
Dynamic Programming/Matrix Chain Multiplication/Python/MatrixChainMult.py:3
↓ 1 callersMethodMatrixChainOrder
(int p[], int n)
Dynamic Programming/Matrix Chain Multiplication/Java/MatrixChainMult.java:2
↓ 1 callersFunctionMerge
(left,right,A)
Sorting/Merge Sort/Python/merge_sort.py:1
↓ 1 callersFunctionMergeSort
(A)
Sorting/Merge Sort/Python/merge_sort.py:26
↓ 1 callersFunctionMergeSortLinked
Sorting/Merge Sort/C++/mergeSort_linked_list.cpp:78
↓ 1 callersFunctionMin
data structures/linked list/c/MaxOfLinkedList.c:41
↓ 1 callersFunctionNewBinomialHeap
()
heaps/BinomialHeap/Go/binomial_heap.go:158
↓ 1 callersMethodPigeonHoleSortAscending
(this IList<int> collection)
Sorting/PigeonHoleSorter/PigeonHoleSorter.cs:17
↓ 1 callersFunctionPollardRho
Mathematics/prime.cpp:21
↓ 1 callersFunctionPollardRho
Mathematics/Pollard-Rho/cpp/prime.cpp:18
↓ 1 callersFunctionPrintPath
Dynamic Programming/common sub sequence/cpp/LCS.cpp:21
↓ 1 callersMethodPrintPermutations2
(String str, String asf)
Recursive Algorithms/PrintPemutations.java:15
↓ 1 callersFunctionPrintVerticalOrder
Tree/Traverals/CPP/vertical order traversal.cpp:78
↓ 1 callersMethodPriorityNonpremptive
(process g[],int n)
Other Algorithms/Process Scheduling/java/process.java:486
↓ 1 callersMethodPrioritypremptive
(process e[],int n)
Other Algorithms/Process Scheduling/java/process.java:400
↓ 1 callersMethodQueue
(int size)
data structures/queue/java/queue.java:6
↓ 1 callersFunctionQuickSort
(slice []int)
Sorting/quickSort/Go/quick_sort.go:8
↓ 1 callersFunctionRMax
data structures/linked list/c/MaxOfLinkedList.c:53
↓ 1 callersMethodRoundRobin
(process m[],int n)
Other Algorithms/Process Scheduling/java/process.java:180
↓ 1 callersFunctionSLLDelete
data structures/linked list/c/linked list.c:45
↓ 1 callersFunctionSPFA
Graphs/SPFA/shortest-path-faster-algorithm.cpp:32
↓ 1 callersFunctionShellSort
A function implementing Shell sort.
Sorting/ShellSort/C++/shell_sort.cpp:6
↓ 1 callersFunctionSieve
Mathematics/sieve of Eratosthenes/cpp/Sieve-of-Eratosthenes.cpp:6
↓ 1 callersMethodSjfNp
(process k[],int n)
Other Algorithms/Process Scheduling/java/process.java:106
↓ 1 callersMethodSjfP
(process o[],int n)
Other Algorithms/Process Scheduling/java/process.java:314
↓ 1 callersFunctionSlowSort
(A, i, j)
Sorting/SlowSort/python/SlowSort.py:6
↓ 1 callersFunctionSolve
Bit Manipulation/GeneratingEverySubsetWithBitmask/EverySubset.cpp:4
↓ 1 callersFunctionSolveSudoku
Takes a partially filled-in grid and attempts to assign values to all unassigned locations in such a way to meet the requirements for Sudoku sol
Backtracking/Sudoku solution/C/sudoku.c:20
↓ 1 callersMethodSwap
To Swap two given numbers
Sorting/Bogosort/C Sharp/Bogosort.cs:7
↓ 1 callersMethodSwap
(int A[],int p,int q)
Sorting/quickSort/Java/quick_sort.java:61
↓ 1 callersFunctionTS
Sorting/Topological Sorting/C/topological_sorting.c:61
↓ 1 callersFunctionUsedInBox
Returns a boolean which indicates whether an assigned entry within the specified 3x3 box matches the given number. */
Backtracking/Sudoku solution/C/sudoku.c:83
↓ 1 callersFunctionUsedInCol
Returns a boolean which indicates whether an assigned entry in the specified column matches the given number. */
Backtracking/Sudoku solution/C/sudoku.c:73
↓ 1 callersFunctionUsedInRow
Returns a boolean which indicates whether an assigned entry in the specified row matches the given number. */
Backtracking/Sudoku solution/C/sudoku.c:63
↓ 1 callersMethod_dfs
(self, vertex, visited)
Recursive Algorithms/DFS/Python/dfs_graph.py:13
↓ 1 callersMethod_heapifyDown
(index, value)
heaps/JavaScript/heap.js:40
↓ 1 callersMethod_insert
Insertion helper for inserting a node into the forest @param cur : Node where the insertion should happen @param sibling : No
heaps/BinomialHeap/Python/binomial_heap.py:58
↓ 1 callersFunction_quick_sort
(arr: &mut [T], low: isize, high: isize)
Sorting/quickSort/Rust/quick-sort.rs:6
↓ 1 callersMethodabortAfter
Searching/binary search/c/test/catch.hpp:4082
↓ 1 callersFunctionactivities
Greedy Algorithms/Activity Selection/C/activitysel.c:4
↓ 1 callersFunctionactivity_selection
(activity_arr)
Greedy Algorithms/Activity Selection/python/activity_selection.py:16
↓ 1 callersFunctionadd
Other Algorithms/Suffix Automaton/CPP/SA.cpp:21
↓ 1 callersFunctionaddAtEnd
inserting a node at the end of the list
LinkedList/Reverse/Reversal_of_Single_Linked_List/C/iterative_reversal.c:20
↓ 1 callersMethodaddAtIndex
(int index,int value)
LinkedList/Java/LinkedList.java:42
↓ 1 callersMethodaddEdge
(self,vertexFrom,vertexTo)
data structures/Graph/Example/GraphExample.py:22
↓ 1 callersMethodaddInitialFilters
Searching/binary search/c/test/catch.hpp:6311
↓ 1 callersFunctionaddListeners
Searching/binary search/c/test/catch.hpp:7056
↓ 1 callersMethodaddNodes
Graphs/Minimum Spanning Tree/C++/data-structures/LinkedGraph.cpp:9
↓ 1 callersFunctionaddTestOrTags
Searching/binary search/c/test/catch.hpp:5158
← previousnext →601–700 of 3,327, ranked by callers