Code
Hub
Workspaces
Following
Trending
Connect
MCP
copy
Create free account
hub
/
github.com/VAR-solutions/Algorithms
/ functions
Functions
3,327 in github.com/VAR-solutions/Algorithms
⨍
Functions
3,327
◇
Types & classes
712
↓ 8 callers
Function
ishex
+============================================================================= Check for a valid hex digit
Arduino_Code/Arduino-IRremote/irPronto.cpp:26
↓ 8 callers
Function
merge
(a *node, b *node)
heaps/BinomialHeap/Go/binomial_heap.go:64
↓ 8 callers
Function
newNode
A utility function to create a node
Dynamic Programming/Minimum Vertex Cover/Solution.cpp:46
↓ 8 callers
Function
newnode
Tree/right_view_binary_tree/cpp/right_view_binary_tree.cpp:10
↓ 8 callers
Method
pop
(self)
data structures/Graph/GraphDFS.py:17
↓ 8 callers
Method
pop_back
data structures/array/Array_List.cpp:126
↓ 8 callers
Method
remove
Tree/AVLTree/AVL.cpp:252
↓ 8 callers
Function
rep
Tree/Trie/Trie.cpp:96
↓ 8 callers
Function
swap
Sorting/quickSort/C/quick_sort.c:3
↓ 7 callers
Function
DLLInsert
data structures/linked list/c/linked list.c:92
↓ 7 callers
Function
SLLInsert
data structures/linked list/c/linked list.c:24
↓ 7 callers
Function
addEdge
Graphs/bfs/c/bfs.c:96
↓ 7 callers
Function
addedge
Sorting/Topological Sorting/C/topological_sorting.c:17
↓ 7 callers
Function
binary_search
Searching/binary search/c/binary_search.c:1
↓ 7 callers
Method
contains
data structures/array/Array_List.cpp:166
↓ 7 callers
Method
getConfig
Searching/binary search/c/test/catch.hpp:7822
↓ 7 callers
Function
getNode
Helper function that allocates a new node with the given data and NULL left and right pointers. */
Tree/Binary Search Tree/Bst to min heap.cpp:18
↓ 7 callers
Method
get_next
(self)
data structures/linked list/python/Stack_with_Singly_Linked_List.py:9
↓ 7 callers
Method
get_next
(self)
data structures/linked list/python/Singly-linked-list.py:9
↓ 7 callers
Function
htow
+============================================================================= Hex-to-Word : Decode a block of 4 hex digits We assume the string has a
Arduino_Code/Arduino-IRremote/irPronto.cpp:65
↓ 7 callers
Function
insert
A utility function to insert a new node with given key in BST */
Tree/Binary Search Tree/tree_delete_node.cpp:32
↓ 7 callers
Method
isEmpty
()
heaps/JavaScript/heap.js:15
↓ 7 callers
Function
is_empty_list
* Vérifie si une List est vide * @param li La liste à tester * @return true si elle est vide, faux sinon */
data structures/linked list/c/list.c:21
↓ 7 callers
Function
link
(a *node, b *node)
heaps/BinomialHeap/Go/binomial_heap.go:21
↓ 7 callers
Method
min
(int a,int b)
Graphs/Floyd/Java/Floyds.java:4
↓ 7 callers
Function
sum
Tree/OptimalBST.c:28
↓ 6 callers
Method
addEdge
(self, i, vertex)
Recursive Algorithms/DFS/Python/dfs_graph.py:6
↓ 6 callers
Method
addEdge
(i, vertex)
Recursive Algorithms/DFS/Ruby/graph_dfs.rb:8
↓ 6 callers
Method
addEdge
Graphs/topologicalSort/topologicalSort.cpp:29
↓ 6 callers
Method
addEdge
Graphs/bfs/cpp/bfs.cpp:31
↓ 6 callers
Method
addEdge
(self,u,v)
Graphs/dfs/python/dfs.py:8
↓ 6 callers
Method
addEdge
Graphs/dfs/cpp/dfs.cpp:34
↓ 6 callers
Method
b_sort
(process temp7[],int n)
Other Algorithms/Process Scheduling/java/process.java:93
↓ 6 callers
Function
capturedExpressionWithSecondArgument
Searching/binary search/c/test/catch.hpp:8204
↓ 6 callers
Function
count
Tree/AVLTree/AVL.cpp:229
↓ 6 callers
Method
enqueue
(value)
data structures/queue/ruby/queue.rb:8
↓ 6 callers
Method
find
(subset subsets[], int i)
Graphs/kruskal/Java/KruskalAlgo.java:41
↓ 6 callers
Function
getBalance
else return -a; }
data structures/trie/c/AVL.c:136
↓ 6 callers
Function
getBalance
Tree/AVLTree/AVL.cpp:54
↓ 6 callers
Function
getNode
data structures/linked list/cpp/doubly_circular_linked_list.cpp:12
↓ 6 callers
Method
getValue
Graphs/Minimum Spanning Tree/C++/data-structures/LinkedListElement.cpp:19
↓ 6 callers
Method
getVertexNumber
(self,value)
data structures/Graph/GraphAL.py:20
↓ 6 callers
Method
getVertexNumber
(self,value)
data structures/Graph/Example/GraphExample.py:20
↓ 6 callers
Method
hasExpression
Searching/binary search/c/test/catch.hpp:8196
↓ 6 callers
Function
insert
(root,node)
Graphs/BinaryTree/python/binaryTree.py:9
↓ 6 callers
Method
insert
Tree/Binary Tree to Linked List/cpp/BinaryTreeToLinkedList.cpp:19
↓ 6 callers
Method
isVertex
Método que verifica se é um vertice @param v Nome do vértice @return Uma resposta true caso o nome seja de um vértice, e false caso não
Graphs/Dijkstra Algorithm/Java/Grafo.java:29
↓ 6 callers
Function
leftRotate
Tree/AVLTree/AVL.cpp:43
↓ 6 callers
Function
max
data structures/trie/c/AVL.c:27
↓ 6 callers
Function
newNode
Tree/TopView_binary_tree.cpp:12
↓ 6 callers
Method
parse
Searching/binary search/c/test/catch.hpp:5009
↓ 6 callers
Method
prln
(Object ob)
AI Forward Chaining Resolution/ForwardChaining.java:78
↓ 6 callers
Method
push
(val: T)
data structures/queue/ts/queue.ts:3
↓ 6 callers
Function
rightRotate
Tree/AVLTree/AVL.cpp:32
↓ 6 callers
Method
set
Searching/binary search/c/test/catch.hpp:4544
↓ 6 callers
Method
showDurations
Searching/binary search/c/test/catch.hpp:4077
↓ 6 callers
Function
swap
(arr, firstItemIndex, lastItemIndex)
Sorting/Heapsort/Javascript/heapsort.js:11
↓ 6 callers
Function
validate
+============================================================================= String must be block of 4 hex digits separated with blanks
Arduino_Code/Arduino-IRremote/irPronto.cpp:350
↓ 5 callers
Function
ComputeFrequency
ComputeFrequency computes a relative frequency map of all characters in the array.
Greedy Algorithms/Huffman/go/huffman.go:107
↓ 5 callers
Function
FOR
cin.ignore();
Graphs/Finding Articulation Points and bridges/cpp/Finding Articulation Points and bridges.cpp:53
↓ 5 callers
Function
add
data structures/heap/C/heap.c:5
↓ 5 callers
Method
addEdge
Graphs/bfs/cpp/iterative_bfs.cpp:23
↓ 5 callers
Method
addEdge
(self,u,v,w)
Graphs/Minimum Spanning Tree/python/MST_kruskal.py:17
↓ 5 callers
Method
addEdge
Graphs/dfs/cpp/iterative_dfs.cpp:26
↓ 5 callers
Method
addVecinos
(Nodo nVecino)
Graphs/bfs/java/bfs.java:19
↓ 5 callers
Method
add_edge
Graphs/Floyd/Cplusplus/floydWarshall.cpp:52
↓ 5 callers
Method
at
(index, value)
data structures/linked list/javascript/linkedList.js:83
↓ 5 callers
Function
convertInto
Searching/binary search/c/test/catch.hpp:4480
↓ 5 callers
Function
create
data structures/linked list/cpp/singly_reversed_linked_list.cpp:12
↓ 5 callers
Method
delete
(int key)
LinkedList/LinkList.java:31
↓ 5 callers
Method
find
(self, parent, i)
Graphs/Minimum Spanning Tree/python/MST_kruskal.py:22
↓ 5 callers
Method
getPreviousElement
Graphs/Minimum Spanning Tree/C++/data-structures/LinkedListElement.cpp:24
↓ 5 callers
Method
get_next
(self)
data structures/linked list/python/Queue_with_Singly_Linked_List.py:9
↓ 5 callers
Method
hasFilters
Searching/binary search/c/test/catch.hpp:3695
↓ 5 callers
Function
indexOf
This function associates each piece with a number
Combinatorial Game Theory/Zobrist Hashing/zobrist.cpp:19
↓ 5 callers
Function
insert
To insert a node in the tree */
Tree/Binary Search Tree/bst.c:64
↓ 5 callers
Function
insert
(cur *node, sibling *node)
heaps/BinomialHeap/Go/binomial_heap.go:42
↓ 5 callers
Method
match
Searching/binary search/c/test/catch.hpp:9435
↓ 5 callers
Method
matches
Searching/binary search/c/test/catch.hpp:3698
↓ 5 callers
Function
max
A utility function to get maximum of two integers
Tree/AVLTree/AVL_Tree.cpp:26
↓ 5 callers
Method
pop
()
data structures/queue/ts/queue.ts:6
↓ 5 callers
Method
push
(int x)
data structures/stack/java/SpecialStack.java:18
↓ 5 callers
Method
push
(element, weight)
data structures/queue/ruby/priority_queue.rb:7
↓ 5 callers
Method
rngSeed
Searching/binary search/c/test/catch.hpp:4079
↓ 5 callers
Method
sectionEnded
Searching/binary search/c/test/catch.hpp:8620
↓ 5 callers
Method
setNextElement
Graphs/Minimum Spanning Tree/C++/data-structures/LinkedListElement.cpp:39
↓ 4 callers
Method
Append
(T data)
data structures/linked list/cs/LinkedList/LinkedList.cs:37
↓ 4 callers
Function
XOR
data structures/linked list/c/xor linked_list.c:9
↓ 4 callers
Method
__len__
(self)
data structures/linked list/python/Singly-linked-list.py:66
↓ 4 callers
Method
add
(Tip e)
Tree/Binary Search Tree/bst.java:109
↓ 4 callers
Function
addEdge
Graphs/dfs/c/dfs.c:74
↓ 4 callers
Method
addEdge
Graphs/Minimum Spanning Tree/C++/data-structures/LinkedGraph.cpp:15
↓ 4 callers
Method
adjustString
Searching/binary search/c/test/catch.hpp:9405
↓ 4 callers
Method
assertionEnded
Searching/binary search/c/test/catch.hpp:8603
↓ 4 callers
Function
build
Tree/segment tree/cpp/EfficientSingleElementModification.cpp:5
↓ 4 callers
Method
build
(self)
Other Algorithms/String/python/ahocorasick.py:18
↓ 4 callers
Function
convert_to_words
(num)
Other Algorithms/NumberToWords.py:1
↓ 4 callers
Method
create
Searching/binary search/c/test/catch.hpp:7485
↓ 4 callers
Function
deQueue
data structures/queue/c/queue_using_stack.c:22
↓ 4 callers
Function
display
data structures/quick.cpp:70
← previous
next →
101–200 of 3,327, ranked by callers