Functions — github.com/akzare/Algorithms

CodeHub MCPcopy Create free account

hub / github.com/akzare/Algorithms / functions

Functions688 in github.com/akzare/Algorithms

⨍ Functions 688◇ Types & classes 127

↓ 174 callersMethodsize

Get size of graph

src/main/cpp/algorithms/graphtheory/Graph.h:120

↓ 135 callersMethodaddDirectedEdge

Add a directed edge from node 'u' to node 'v' with cost 'cost'. Adds a directed edge to the graph. @param from - The index of the node the directed

src/main/cpp/algorithms/graphtheory/Graph.h:139

↓ 118 callersMethodadd

src/test/cpp/algorithms/datastructures/binarysearchtree/BinarySearchTreeTest.cpp:68

↓ 77 callersMethodaddUndirectedEdge

Add an undirected edge between nodes 'u' and 'v'.

src/main/cpp/algorithms/graphtheory/Graph.h:146

↓ 71 callersMethodend

End of LInkedList wrapped in Iterator type

src/main/cpp/algorithms/datastructures/linkedlist/DoublyLinkedList.h:417

↓ 60 callersMethodbegin

Root of LinkedList wrapped in Iterator type

src/main/cpp/algorithms/datastructures/linkedlist/DoublyLinkedList.h:411

↓ 30 callersMethodclear

Empty this graph

src/main/cpp/algorithms/graphtheory/Graph.h:112

↓ 29 callersMethodisEmpty

return if the stack is empty

src/main/python/algorithms/datastructures/stack/Stack.py:24

↓ 28 callersMethodremove

Remove a particular value in the linked list, O(n)

src/main/cpp/algorithms/datastructures/linkedlist/DoublyLinkedList.h:378

↓ 27 callersMethodsize

Return the number of elements in the stack

src/main/cpp/algorithms/datastructures/stack/ListStack.h:99

↓ 24 callersMethodpeekFirst

Check the value of the first node if it exists, O(1)

src/main/cpp/algorithms/datastructures/linkedlist/DoublyLinkedList.h:223

↓ 23 callersMethodpeekLast

Check the value of the last node if it exists, O(1)

src/main/cpp/algorithms/datastructures/linkedlist/DoublyLinkedList.h:230

↓ 22 callersMethodpush

Push an element on the stack

src/main/cpp/algorithms/datastructures/stack/ListStack.h:114

↓ 20 callersMethodheight

Computes the height of the tree, O(n)

src/main/cpp/algorithms/datastructures/binarysearchtree/BinarySearchTree.h:562

↓ 19 callersMethodadd

Add an element to this binary tree. Returns true if we successfully perform an insertion

src/main/cpp/algorithms/datastructures/binarysearchtree/BinarySearchTree.h:396

↓ 19 callersMethodaddUnweightedUndirectedEdge

Add an undirected un-weighted edge between nodes 'u' and 'v'. The edge added will have a weight of 1 since its intended to be unweighted.

src/main/cpp/algorithms/graphtheory/Graph.h:154

↓ 18 callersMethodaddFirst

Add an element to the beginning of this linked list, O(1)

src/main/cpp/algorithms/datastructures/linkedlist/DoublyLinkedList.h:183

↓ 18 callersMethodinsert

src/main/cpp/algorithms/graphtheory/DijkstrasShortestPathAdjacencyListWithDHeap.h:141

↓ 17 callersMethodoffer

Add an element to the queue

src/main/python/algorithms/datastructures/queue/IntQueue.py:59

↓ 16 callersFunctiongenerateRandomInt

src/test/cpp/algorithms/graphtheory/BreadthFirstSearchAdjacencyListIterativeTest.cpp:30

↓ 16 callersMethodisEmpty

Return true/false on whether the queue is empty

src/main/python/algorithms/datastructures/queue/IntQueue.py:33

↓ 16 callersMethodpeek

src/main/python/algorithms/datastructures/stack/Stack.py:48

↓ 16 callersMethodpop

pop the element off the stack

src/main/python/algorithms/datastructures/stack/Stack.py:40

↓ 15 callersMethodpoll

Make sure you check is the queue is not empty before calling poll!

src/main/python/algorithms/datastructures/queue/IntQueue.py:72

↓ 14 callersMethodpush

push the element on the stack

src/main/python/algorithms/datastructures/stack/Stack.py:32

↓ 13 callersMethodget

Get the value associated with the input key. NOTE: returns null if the value is null AND also returns null if the key does not exists.

src/main/cpp/algorithms/datastructures/hashtable/HashTableOpenAddressingBase.h:337

↓ 13 callersFunctionswap

src/main/cpp/algorithms/graphtheory/TspBruteForce.h:65

↓ 12 callersMethodadd

Add an element to the tail of the linked list, O(1)

src/main/cpp/algorithms/datastructures/linkedlist/DoublyLinkedList.h:164

↓ 12 callersMethodgetMax

src/main/python/algorithms/other/SlidingWindowMaximum.py:60

↓ 12 callersMethodsize

Get the number of nodes in this binary tree

src/main/cpp/algorithms/datastructures/binarysearchtree/BinarySearchTree.h:389

↓ 10 callersMethodadd

Add `x` to the range [l, r] inclusive

src/main/python/algorithms/other/LazyRangeAdder.py:46

↓ 10 callersMethodaddAt

Add an element at a specified index

src/main/cpp/algorithms/datastructures/linkedlist/DoublyLinkedList.h:196

↓ 10 callersMethodaddLast

Add a node to the tail of the linked list, O(1)

src/main/cpp/algorithms/datastructures/linkedlist/DoublyLinkedList.h:170

↓ 10 callersMethodid

return the ID the stack implementation

src/main/cpp/algorithms/datastructures/stack/Stack.h:45

↓ 10 callersMethodisPowerOfTwo

Verifies if a number n is a power of two

src/main/cpp/algorithms/other/BitManipulations.h:68

↓ 10 callersMethodoffer

src/main/python/algorithms/datastructures/queue/Queue.py:17

↓ 10 callersMethodremoveLast

Remove the last value at the tail of the linked list, O(1)

src/main/cpp/algorithms/datastructures/linkedlist/DoublyLinkedList.h:259

↓ 10 callersMethodsize

Return the number of elements inside the queue

src/main/python/algorithms/datastructures/queue/IntQueue.py:40

↓ 9 callersMethodLeft

src/main/cpp/algorithms/datastructures/binarysearchtree/BinarySearchTree.h:299

↓ 9 callersMethodRight

src/main/cpp/algorithms/datastructures/binarysearchtree/BinarySearchTree.h:300

↓ 9 callersMethodpoll

src/main/python/algorithms/datastructures/queue/Queue.py:21

↓ 9 callersMethodpop

Pop an element off the stack Throws an error is the stack is empty

src/main/cpp/algorithms/datastructures/stack/ListStack.h:120

↓ 9 callersMethodpush

src/main/python/algorithms/datastructures/stack/ArrayStack.py:35

↓ 9 callersMethodpush

Add an element to the top of the stack

src/main/python/algorithms/datastructures/stack/IntStack.py:54

↓ 9 callersMethodremoveAt

Remove a node at a particular index, O(n)

src/main/cpp/algorithms/datastructures/linkedlist/DoublyLinkedList.h:353

↓ 8 callersMethodisEmpty

Is this linked list empty?

src/main/python/algorithms/datastructures/linkedlist/DoublyLinkedList.py:69

↓ 8 callersMethodoffer

Add an element to the back of the queue

src/main/python/algorithms/datastructures/queue/LinkedQueue.py:56

↓ 8 callersMethodoffer

src/main/python/algorithms/datastructures/queue/ArrayQueue.py:28

↓ 8 callersMethodpoll

Poll an element from the front of the queue The method throws an error is the queue is empty

src/main/python/algorithms/datastructures/queue/LinkedQueue.py:46

↓ 8 callersMethodpoll

src/main/python/algorithms/datastructures/queue/ArrayQueue.py:37

↓ 8 callersFunctionrandInt

src/test/cpp/algorithms/datastructures/hashtable/HashTableLinearProbingTest.cpp:33

↓ 7 callersMethodadvance

Advances the front of the window by one unit

src/main/python/algorithms/other/SlidingWindowMaximum.py:29

↓ 7 callersMethodput

src/main/cpp/algorithms/datastructures/hashtable/HashTableOpenAddressingBase.h:144

↓ 7 callersMethodreconstructPath

Reconstructs the shortest path (of nodes) from 'start' to 'end' inclusive. @return An array of nodes indexes of the shortest path from 'start' to 'en

src/main/cpp/algorithms/graphtheory/DijkstrasShortestPathAdjacencyList.h:268

↓ 7 callersMethodsccCount

Returns the number of strongly connected components in the graph.

src/main/cpp/algorithms/graphtheory/TarjanSccSolverAdjacencyList.h:152

↓ 6 callersMethodgetSccs

Get the connected components of this graph. If two indexes have the same value then they're in the same SCC.

src/main/cpp/algorithms/graphtheory/TarjanSccSolverAdjacencyList.h:160

↓ 6 callersMethodgetTourCost

Returns the minimal tour cost.

src/main/cpp/algorithms/graphtheory/TspDynamicProgrammingIterative.h:311

↓ 6 callersMethodinorder_iter

src/main/cpp/algorithms/datastructures/binarysearchtree/BinarySearchTree.h:354

↓ 6 callersMethodlevelorder_iter

src/main/cpp/algorithms/datastructures/binarysearchtree/BinarySearchTree.h:356

↓ 6 callersMethodpop

Make sure you check that the stack is not empty before calling pop!

src/main/python/algorithms/datastructures/stack/IntStack.py:62

↓ 6 callersMethodpostorder_iter

src/main/cpp/algorithms/datastructures/binarysearchtree/BinarySearchTree.h:355

↓ 6 callersMethodpreorder_iter

src/main/cpp/algorithms/datastructures/binarysearchtree/BinarySearchTree.h:353

↓ 6 callersMethodremoveFirst

Remove the first value at the head of the linked list, O(1)

src/main/cpp/algorithms/datastructures/linkedlist/DoublyLinkedList.h:237

↓ 6 callersMethodsetBit

Sets the i'th bit to 1

src/main/cpp/algorithms/other/BitManipulations.h:38

↓ 6 callersMethodshrink

Retracks the back of the window by one unit

src/main/python/algorithms/other/SlidingWindowMaximum.py:45

↓ 6 callersMethodsort

src/main/cpp/algorithms/sorting/Heapsort.h:35

↓ 5 callersFunctioncomputeTourCost

src/main/cpp/algorithms/graphtheory/TspBruteForce.h:41

↓ 5 callersMethodcontains

returns true is the element exists in the tree

src/main/cpp/algorithms/datastructures/binarysearchtree/BinarySearchTree.h:536

↓ 5 callersMethodcontains

Check is a value is contained within the linked list

src/main/cpp/algorithms/datastructures/linkedlist/DoublyLinkedList.h:406

↓ 5 callersMethoddel

src/main/cpp/algorithms/datastructures/hashtable/HashTableOpenAddressingBase.h:152

↓ 5 callersMethoddone

IMPORTANT: Make certain to call this method once all the additions have been made with add(l, r, x)

src/main/python/algorithms/other/LazyRangeAdder.py:55

↓ 5 callersFunctiongenRandInt

src/test/cpp/algorithms/search/SearchingTest.cpp:32

↓ 5 callersMethodgenRandList

src/test/python/algorithms/datastructures/binarysearchtree/BinarySearchTreeTest.py:363

↓ 5 callersMethodgetMinWeightCost

src/test/cpp/algorithms/dp/MinimumWeightPerfectMatchingTest.cpp:47

↓ 5 callersMethodpeek

src/main/python/algorithms/datastructures/queue/IntQueue.py:47

↓ 5 callersMethodpop

src/main/python/algorithms/datastructures/stack/ArrayStack.py:42

↓ 5 callersMethodreconstructShortestPath

Reconstructs the shortest path (of nodes) from 'start' to 'end' inclusive. @return An array of nodes indexes of the shortest path from 'start' to 'en

src/main/cpp/algorithms/graphtheory/FloydWarshallSolver.h:195

↓ 5 callersMethodsize

src/main/cpp/algorithms/datastructures/queue/ArrayQueue.h:89

↓ 5 callersMethodtoString

src/main/cpp/algorithms/graphtheory/Graph.h:175

↓ 4 callersMethodaddLast

Add a node to the tail of the linked list, O(1)

src/main/python/algorithms/datastructures/linkedlist/DoublyLinkedList.py:83

↓ 4 callersMethodadjustIndex

(self, index, size)

src/main/python/algorithms/datastructures/queue/ArrayQueue.py:61

↓ 4 callersMethodbegin

Root of LinkedList wrapped in Iterator type

src/main/cpp/algorithms/datastructures/hashtable/HashTableOpenAddressingBase.h:475

↓ 4 callersMethodblockID

src/main/python/algorithms/other/SquareRootDecomposition.py:34

↓ 4 callersMethodclear

src/main/cpp/algorithms/datastructures/hashtable/HashTableOpenAddressingBase.h:123

↓ 4 callersMethodclearBit

Sets the i'th bit to zero

src/main/cpp/algorithms/other/BitManipulations.h:50

↓ 4 callersMethodend

End of LInkedList wrapped in Iterator type

src/main/cpp/algorithms/datastructures/hashtable/HashTableOpenAddressingBase.h:480

↓ 4 callersFunctiongenRandInt

src/test/cpp/algorithms/dp/MinimumWeightPerfectMatchingTest.cpp:111

↓ 4 callersFunctiongetSortedBridges

src/test/cpp/algorithms/graphtheory/BridgesAdjacencyListTest.cpp:25

↓ 4 callersMethodinterpolationSearch

* A fast alternative to a binary search when the elements are uniformly distributed. This * algorithm runs in a time complexity of ~O(log(log(n))).

src/main/cpp/algorithms/search/InterpolationSearch.h:45

↓ 4 callersMethodisEmpty

Returns whether or not the queue is empty

src/main/python/algorithms/datastructures/queue/LinkedQueue.py:29

↓ 4 callersMethodisEmpty

src/main/python/algorithms/datastructures/queue/ArrayQueue.py:53

↓ 4 callersMethodkeys

Returns a list of keys found in the hash table

src/main/cpp/algorithms/datastructures/hashtable/HashTableOpenAddressingBase.h:162

↓ 4 callersMethodlazyRangeAdder

Initialize an instance of a LazyRangeAdder on some input values

src/main/python/algorithms/other/LazyRangeAdder.py:32

↓ 4 callersMethodquery

Get sum query from [lo, hi] in O(sqrt(n))

src/main/python/algorithms/other/SquareRootDecomposition.py:49

↓ 4 callersFunctionrandInt

src/test/cpp/algorithms/datastructures/binarysearchtree/BinarySearchTreeTest.cpp:26

↓ 4 callersMethodrandValue

Generates a random number between [min, max)

src/test/python/algorithms/other/LazyRangeAdderTest.py:96

↓ 4 callersFunctionrandomFillDistMatrix

src/test/cpp/algorithms/graphtheory/TravelingSalesmanProblemTest.cpp:39

↓ 4 callersFunctionrandomFillSymmetricMatrix

src/test/cpp/algorithms/dp/MinimumWeightPerfectMatchingTest.cpp:125

↓ 4 callersMethodremove

Remove a value from this binary tree if it exists, O(n)

src/main/cpp/algorithms/datastructures/binarysearchtree/BinarySearchTree.h:433

↓ 4 callersFunctiontsp

Given an nxn complete graph represented as an adjacency matrix this method finds the best tour that visits all the nodes while minimizing the overall

src/main/cpp/algorithms/graphtheory/TspBruteForce.h:93

next →1–100 of 688, ranked by callers