MCPcopy Create free account

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

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

↓ 8 callersFunctionishex
+============================================================================= Check for a valid hex digit
Arduino_Code/Arduino-IRremote/irPronto.cpp:26
↓ 8 callersFunctionmerge
(a *node, b *node)
heaps/BinomialHeap/Go/binomial_heap.go:64
↓ 8 callersFunctionnewNode
A utility function to create a node
Dynamic Programming/Minimum Vertex Cover/Solution.cpp:46
↓ 8 callersFunctionnewnode
Tree/right_view_binary_tree/cpp/right_view_binary_tree.cpp:10
↓ 8 callersMethodpop
(self)
data structures/Graph/GraphDFS.py:17
↓ 8 callersMethodpop_back
data structures/array/Array_List.cpp:126
↓ 8 callersMethodremove
Tree/AVLTree/AVL.cpp:252
↓ 8 callersFunctionrep
Tree/Trie/Trie.cpp:96
↓ 8 callersFunctionswap
Sorting/quickSort/C/quick_sort.c:3
↓ 7 callersFunctionDLLInsert
data structures/linked list/c/linked list.c:92
↓ 7 callersFunctionSLLInsert
data structures/linked list/c/linked list.c:24
↓ 7 callersFunctionaddEdge
Graphs/bfs/c/bfs.c:96
↓ 7 callersFunctionaddedge
Sorting/Topological Sorting/C/topological_sorting.c:17
↓ 7 callersFunctionbinary_search
Searching/binary search/c/binary_search.c:1
↓ 7 callersMethodcontains
data structures/array/Array_List.cpp:166
↓ 7 callersMethodgetConfig
Searching/binary search/c/test/catch.hpp:7822
↓ 7 callersFunctiongetNode
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 callersMethodget_next
(self)
data structures/linked list/python/Stack_with_Singly_Linked_List.py:9
↓ 7 callersMethodget_next
(self)
data structures/linked list/python/Singly-linked-list.py:9
↓ 7 callersFunctionhtow
+============================================================================= Hex-to-Word : Decode a block of 4 hex digits We assume the string has a
Arduino_Code/Arduino-IRremote/irPronto.cpp:65
↓ 7 callersFunctioninsert
A utility function to insert a new node with given key in BST */
Tree/Binary Search Tree/tree_delete_node.cpp:32
↓ 7 callersMethodisEmpty
()
heaps/JavaScript/heap.js:15
↓ 7 callersFunctionis_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 callersFunctionlink
(a *node, b *node)
heaps/BinomialHeap/Go/binomial_heap.go:21
↓ 7 callersMethodmin
(int a,int b)
Graphs/Floyd/Java/Floyds.java:4
↓ 7 callersFunctionsum
Tree/OptimalBST.c:28
↓ 6 callersMethodaddEdge
(self, i, vertex)
Recursive Algorithms/DFS/Python/dfs_graph.py:6
↓ 6 callersMethodaddEdge
(i, vertex)
Recursive Algorithms/DFS/Ruby/graph_dfs.rb:8
↓ 6 callersMethodaddEdge
Graphs/topologicalSort/topologicalSort.cpp:29
↓ 6 callersMethodaddEdge
Graphs/bfs/cpp/bfs.cpp:31
↓ 6 callersMethodaddEdge
(self,u,v)
Graphs/dfs/python/dfs.py:8
↓ 6 callersMethodaddEdge
Graphs/dfs/cpp/dfs.cpp:34
↓ 6 callersMethodb_sort
(process temp7[],int n)
Other Algorithms/Process Scheduling/java/process.java:93
↓ 6 callersFunctioncapturedExpressionWithSecondArgument
Searching/binary search/c/test/catch.hpp:8204
↓ 6 callersFunctioncount
Tree/AVLTree/AVL.cpp:229
↓ 6 callersMethodenqueue
(value)
data structures/queue/ruby/queue.rb:8
↓ 6 callersMethodfind
(subset subsets[], int i)
Graphs/kruskal/Java/KruskalAlgo.java:41
↓ 6 callersFunctiongetBalance
else return -a; }
data structures/trie/c/AVL.c:136
↓ 6 callersFunctiongetBalance
Tree/AVLTree/AVL.cpp:54
↓ 6 callersFunctiongetNode
data structures/linked list/cpp/doubly_circular_linked_list.cpp:12
↓ 6 callersMethodgetValue
Graphs/Minimum Spanning Tree/C++/data-structures/LinkedListElement.cpp:19
↓ 6 callersMethodgetVertexNumber
(self,value)
data structures/Graph/GraphAL.py:20
↓ 6 callersMethodgetVertexNumber
(self,value)
data structures/Graph/Example/GraphExample.py:20
↓ 6 callersMethodhasExpression
Searching/binary search/c/test/catch.hpp:8196
↓ 6 callersFunctioninsert
(root,node)
Graphs/BinaryTree/python/binaryTree.py:9
↓ 6 callersMethodinsert
Tree/Binary Tree to Linked List/cpp/BinaryTreeToLinkedList.cpp:19
↓ 6 callersMethodisVertex
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 callersFunctionleftRotate
Tree/AVLTree/AVL.cpp:43
↓ 6 callersFunctionmax
data structures/trie/c/AVL.c:27
↓ 6 callersFunctionnewNode
Tree/TopView_binary_tree.cpp:12
↓ 6 callersMethodparse
Searching/binary search/c/test/catch.hpp:5009
↓ 6 callersMethodprln
(Object ob)
AI Forward Chaining Resolution/ForwardChaining.java:78
↓ 6 callersMethodpush
(val: T)
data structures/queue/ts/queue.ts:3
↓ 6 callersFunctionrightRotate
Tree/AVLTree/AVL.cpp:32
↓ 6 callersMethodset
Searching/binary search/c/test/catch.hpp:4544
↓ 6 callersMethodshowDurations
Searching/binary search/c/test/catch.hpp:4077
↓ 6 callersFunctionswap
(arr, firstItemIndex, lastItemIndex)
Sorting/Heapsort/Javascript/heapsort.js:11
↓ 6 callersFunctionvalidate
+============================================================================= String must be block of 4 hex digits separated with blanks
Arduino_Code/Arduino-IRremote/irPronto.cpp:350
↓ 5 callersFunctionComputeFrequency
ComputeFrequency computes a relative frequency map of all characters in the array.
Greedy Algorithms/Huffman/go/huffman.go:107
↓ 5 callersFunctionFOR
cin.ignore();
Graphs/Finding Articulation Points and bridges/cpp/Finding Articulation Points and bridges.cpp:53
↓ 5 callersFunctionadd
data structures/heap/C/heap.c:5
↓ 5 callersMethodaddEdge
Graphs/bfs/cpp/iterative_bfs.cpp:23
↓ 5 callersMethodaddEdge
(self,u,v,w)
Graphs/Minimum Spanning Tree/python/MST_kruskal.py:17
↓ 5 callersMethodaddEdge
Graphs/dfs/cpp/iterative_dfs.cpp:26
↓ 5 callersMethodaddVecinos
(Nodo nVecino)
Graphs/bfs/java/bfs.java:19
↓ 5 callersMethodadd_edge
Graphs/Floyd/Cplusplus/floydWarshall.cpp:52
↓ 5 callersMethodat
(index, value)
data structures/linked list/javascript/linkedList.js:83
↓ 5 callersFunctionconvertInto
Searching/binary search/c/test/catch.hpp:4480
↓ 5 callersFunctioncreate
data structures/linked list/cpp/singly_reversed_linked_list.cpp:12
↓ 5 callersMethoddelete
(int key)
LinkedList/LinkList.java:31
↓ 5 callersMethodfind
(self, parent, i)
Graphs/Minimum Spanning Tree/python/MST_kruskal.py:22
↓ 5 callersMethodgetPreviousElement
Graphs/Minimum Spanning Tree/C++/data-structures/LinkedListElement.cpp:24
↓ 5 callersMethodget_next
(self)
data structures/linked list/python/Queue_with_Singly_Linked_List.py:9
↓ 5 callersMethodhasFilters
Searching/binary search/c/test/catch.hpp:3695
↓ 5 callersFunctionindexOf
This function associates each piece with a number
Combinatorial Game Theory/Zobrist Hashing/zobrist.cpp:19
↓ 5 callersFunctioninsert
To insert a node in the tree */
Tree/Binary Search Tree/bst.c:64
↓ 5 callersFunctioninsert
(cur *node, sibling *node)
heaps/BinomialHeap/Go/binomial_heap.go:42
↓ 5 callersMethodmatch
Searching/binary search/c/test/catch.hpp:9435
↓ 5 callersMethodmatches
Searching/binary search/c/test/catch.hpp:3698
↓ 5 callersFunctionmax
A utility function to get maximum of two integers
Tree/AVLTree/AVL_Tree.cpp:26
↓ 5 callersMethodpop
()
data structures/queue/ts/queue.ts:6
↓ 5 callersMethodpush
(int x)
data structures/stack/java/SpecialStack.java:18
↓ 5 callersMethodpush
(element, weight)
data structures/queue/ruby/priority_queue.rb:7
↓ 5 callersMethodrngSeed
Searching/binary search/c/test/catch.hpp:4079
↓ 5 callersMethodsectionEnded
Searching/binary search/c/test/catch.hpp:8620
↓ 5 callersMethodsetNextElement
Graphs/Minimum Spanning Tree/C++/data-structures/LinkedListElement.cpp:39
↓ 4 callersMethodAppend
(T data)
data structures/linked list/cs/LinkedList/LinkedList.cs:37
↓ 4 callersFunctionXOR
data structures/linked list/c/xor linked_list.c:9
↓ 4 callersMethod__len__
(self)
data structures/linked list/python/Singly-linked-list.py:66
↓ 4 callersMethodadd
(Tip e)
Tree/Binary Search Tree/bst.java:109
↓ 4 callersFunctionaddEdge
Graphs/dfs/c/dfs.c:74
↓ 4 callersMethodaddEdge
Graphs/Minimum Spanning Tree/C++/data-structures/LinkedGraph.cpp:15
↓ 4 callersMethodadjustString
Searching/binary search/c/test/catch.hpp:9405
↓ 4 callersMethodassertionEnded
Searching/binary search/c/test/catch.hpp:8603
↓ 4 callersFunctionbuild
Tree/segment tree/cpp/EfficientSingleElementModification.cpp:5
↓ 4 callersMethodbuild
(self)
Other Algorithms/String/python/ahocorasick.py:18
↓ 4 callersFunctionconvert_to_words
(num)
Other Algorithms/NumberToWords.py:1
↓ 4 callersMethodcreate
Searching/binary search/c/test/catch.hpp:7485
↓ 4 callersFunctiondeQueue
data structures/queue/c/queue_using_stack.c:22
↓ 4 callersFunctiondisplay
data structures/quick.cpp:70
← previousnext →101–200 of 3,327, ranked by callers