MCPcopy Create free account

hub / github.com/Hemant-Jain-Author/Problem-Solving-in-Data-Structures-Algorithms-using-Java / functions

Functions1,174 in github.com/Hemant-Jain-Author/Problem-Solving-in-Data-Structures-Algorithms-using-Java

⨍ Functions 1,174◇ Types & classes 150
↓ 95 callersMethodaddDirectedEdge
(int source, int dest, int cost)
CHAPTER 12 GRAPHS/Graph.java:34
↓ 90 callersMethodpush
(int value)
CHAPTER 7 STACK/Stack.java:26
↓ 83 callersMethodadd
(int value)
CHAPTER 8 QUEUE/Queue.java:19
↓ 82 callersMethodprint
()
CHAPTER 7 STACK/Stack.java:51
↓ 60 callersMethodaddUndirectedEdge
(int source, int dest, int cost)
CHAPTER 12 GRAPHS/Graph.java:43
↓ 57 callersMethodpop
()
CHAPTER 7 STACK/Stack.java:42
↓ 51 callersMethodget
(T key)
CHAPTER 11 HASH TABLE/CountMap.java:24
↓ 50 callersMethodsort
(int[] arr)
CHAPTER 4 SORTING/ShellSort.java:6
↓ 44 callersMethodisEmpty
()
CHAPTER 7 STACK/Stack.java:22
↓ 40 callersMethodaddHead
(int value)
CHAPTER 6 LINKED LIST/LinkedList.java:34
↓ 34 callersMethodmax
(int a, int b)
CHAPTER 9 TREE/AVLTree.java:208
↓ 33 callersMethodadd
(String word)
CHAPTER 13 STRING ALGORITHMS/TST.java:16
↓ 33 callersMethodprint
()
CHAPTER 12 GRAPHS/Graph.java:52
↓ 29 callersMethodaddUndirectedEdge
(int src, int dst, int cost)
CHAPTER 12 GRAPHS/GraphAM.java:21
↓ 29 callersMethodlength
()
CHAPTER 10 PRIORITY QUEUE & HEAPS/Heap.java:64
↓ 27 callersMethodmin
(int x, int y, int z)
CHAPTER 18 DYNAMIC PROGRAMMING/EditDist.java:2
↓ 26 callersMethodremove
(int key)
CHAPTER 9 TREE/BTree.java:190
↓ 24 callersMethodprint
()
CHAPTER 6 LINKED LIST/LinkedList.java:308
↓ 22 callersMethodcontainsKey
(T key)
CHAPTER 11 HASH TABLE/CountMap.java:30
↓ 21 callersMethodpeek
()
CHAPTER 8 QUEUE/QueueLL.java:24
↓ 21 callersMethodsize
()
CHAPTER 7 STACK/Stack.java:18
↓ 21 callersMethodsize
()
CHAPTER 11 HASH TABLE/CountMap.java:34
↓ 20 callersMethodadd
(int value)
CHAPTER 10 PRIORITY QUEUE & HEAPS/Heap.java:75
↓ 19 callersMethodpeek
()
CHAPTER 10 PRIORITY QUEUE & HEAPS/Heap.java:68
↓ 18 callersMethodpeek
()
CHAPTER 7 STACK/StackLL.java:23
↓ 18 callersMethodremove
()
CHAPTER 10 PRIORITY QUEUE & HEAPS/Heap.java:89
↓ 17 callersMethodremove
(T key)
CHAPTER 11 HASH TABLE/CountMap.java:14
↓ 15 callersMethodremove
()
CHAPTER 8 QUEUE/Queue.java:31
↓ 14 callersMethodaddHead
(int value)
CHAPTER 6 LINKED LIST/CircularLinkedList.java:44
↓ 14 callersMethodheight
(Node n)
CHAPTER 9 TREE/AVLTree.java:23
↓ 14 callersMethodinsert
(int value)
CHAPTER 9 TREE/Tree.java:49
↓ 14 callersMethodsize
()
CHAPTER 8 QUEUE/QueueLL.java:16
↓ 13 callersMethodaddHead
(int value)
CHAPTER 6 LINKED LIST/DoublyLinkedList.java:42
↓ 12 callersMethodprint
()
CHAPTER 6 LINKED LIST/DoublyLinkedList.java:27
↓ 11 callersMethodprint
()
CHAPTER 10 PRIORITY QUEUE & HEAPS/Heap.java:101
↓ 11 callersMethodprint
()
CHAPTER 6 LINKED LIST/CircularLinkedList.java:157
↓ 11 callersMethodprintArray
(int[] arr, int count)
CHAPTER 4 SORTING/SortingEx.java:6
↓ 10 callersMethodinsert
(int key)
CHAPTER 9 TREE/BTree.java:79
↓ 10 callersMethodisEmpty
()
CHAPTER 8 QUEUE/QueueLL.java:20
↓ 10 callersMethodisEmpty
()
CHAPTER 10 PRIORITY QUEUE & HEAPS/Heap.java:60
↓ 10 callersMethodpop
()
CHAPTER 8 QUEUE/Stack.java:13
↓ 9 callersMethodadd
(T key)
CHAPTER 11 HASH TABLE/CountMap.java:6
↓ 9 callersMethodaddHead
(int value)
CHAPTER 6 LINKED LIST/DoublyCircularLinkedList.java:34
↓ 9 callersMethoddfsUtil
(int index, boolean[] visited)
CHAPTER 12 GRAPHS/Graph.java:88
↓ 9 callersMethodinsert
(int data)
CHAPTER 9 TREE/RBTree.java:133
↓ 9 callersMethodisEmpty
()
CHAPTER 6 LINKED LIST/LinkedList.java:22
↓ 9 callersMethodprint
()
CHAPTER 6 LINKED LIST/DoublyCircularLinkedList.java:126
↓ 8 callersMethodaddDirectedEdge
(int src, int dst, int cost)
CHAPTER 12 GRAPHS/GraphAM.java:13
↓ 8 callersMethodget
(int arr[], int k)
CHAPTER 4 SORTING/QuickSelect.java:37
↓ 8 callersMethodinsert
(int data)
CHAPTER 9 TREE/AVLTree.java:54
↓ 8 callersMethodisKnown
(int relation[][], int a, int b)
CHAPTER 7 STACK/StackExercise.java:925
↓ 8 callersMethodprintInOrder
()
CHAPTER 9 TREE/Tree.java:124
↓ 7 callersMethodinsert
(int data)
CHAPTER 9 TREE/SPLAYTree.java:134
↓ 7 callersMethodisEmpty
()
CHAPTER 6 LINKED LIST/CircularLinkedList.java:19
↓ 7 callersMethodleftRotate
(Node x)
CHAPTER 9 TREE/RBTree.java:83
↓ 7 callersMethodprint
(int[] Q, int n)
CHAPTER 19 BACKTRACKING/NQueen.java:2
↓ 7 callersMethodpush
(int value)
CHAPTER 8 QUEUE/Stack.java:8
↓ 7 callersMethodrightRotate
(Node x)
CHAPTER 9 TREE/RBTree.java:56
↓ 7 callersMethodswap
(int[] arr, int x, int y)
CHAPTER 4 SORTING/SortingEx.java:14
↓ 6 callersMethodbinarySearch
(int[] arr, int size, int value)
CHAPTER 5 SEARCHING/Searching.java:27
↓ 6 callersMethodfind
(int[] parent, int index)
CHAPTER 12 GRAPHS/Graph.java:452
↓ 6 callersMethodgetMin
(int start, int end)
CHAPTER 9 TREE/rmqST.java:39
↓ 6 callersMethodisEmpty
()
CHAPTER 3 ABSTRACT DATA TYPE/Stack.java:23
↓ 6 callersMethodprint
()
CHAPTER 8 QUEUE/Queue.java:52
↓ 6 callersMethodsize
()
CHAPTER 3 ABSTRACT DATA TYPE/Stack.java:19
↓ 6 callersMethodsortedInsert
(int value)
CHAPTER 6 LINKED LIST/DoublyLinkedList.java:131
↓ 6 callersMethodsortedInsert
(int value)
CHAPTER 6 LINKED LIST/LinkedList.java:317
↓ 6 callersMethodswap
(int[] arr, int i, int j)
CHAPTER 19 BACKTRACKING/Permutations.java:8
↓ 5 callersMethodaddTail
(int value)
CHAPTER 6 LINKED LIST/CircularLinkedList.java:31
↓ 5 callersMethodgetMax
(int start, int end)
CHAPTER 9 TREE/rangeMaxST.java:39
↓ 5 callersMethodleftRotate
(Node x)
CHAPTER 9 TREE/SPLAYTree.java:64
↓ 5 callersMethodprint
()
CHAPTER 12 GRAPHS/GraphAM.java:31
↓ 5 callersMethodpush
(int value)
CHAPTER 7 STACK/StackLL.java:30
↓ 5 callersMethodrightRotate
(Node x)
CHAPTER 9 TREE/SPLAYTree.java:43
↓ 5 callersMethodtransposeGraph
()
CHAPTER 12 GRAPHS/Graph.java:629
↓ 4 callersMethodcomputeHash
(int key)
CHAPTER 11 HASH TABLE/HashTableSC.java:26
↓ 4 callersMethodcomputeHash
(int key)
CHAPTER 11 HASH TABLE/HashTableLP.java:24
↓ 4 callersMethodfind
(int value)
CHAPTER 9 TREE/Tree.java:268
↓ 4 callersMethodgetSum
(int start, int end)
CHAPTER 9 TREE/SegmentTree.java:31
↓ 4 callersMethodleftRotate
(Node x)
CHAPTER 9 TREE/AVLTree.java:115
↓ 4 callersMethodmin
(int X, int Y)
CHAPTER 4 SORTING/SortingEx.java:399
↓ 4 callersMethodpow
(int x, int n)
CHAPTER 13 STRING ALGORITHMS/StringEx.java:230
↓ 4 callersMethodprefixSum
(int index)
CHAPTER 9 TREE/BinaryIndexTree.java:51
↓ 4 callersMethodprint
(Node root, String s)
CHAPTER 16 GREEDY ALGORITHM/HuffmanTree.java:45
↓ 4 callersMethodprint
()
CHAPTER 11 HASH TABLE/HashTableSC.java:59
↓ 4 callersMethodprintTree
()
CHAPTER 9 TREE/AVLTree.java:33
↓ 4 callersMethodresolverFun
(int index)
CHAPTER 11 HASH TABLE/HashTableLP.java:28
↓ 4 callersMethodreverse
()
CHAPTER 6 LINKED LIST/LinkedList.java:135
↓ 4 callersMethodrightRotate
(Node x)
CHAPTER 9 TREE/AVLTree.java:98
↓ 4 callersMethodsplay
(Node node)
CHAPTER 9 TREE/SPLAYTree.java:90
↓ 3 callersMethodadd
(int value)
CHAPTER 8 QUEUE/QueueUsingStack.java:12
↓ 3 callersMethodadd
(int value)
CHAPTER 8 QUEUE/QueueLL.java:36
↓ 3 callersMethodadd
(int key, int value)
CHAPTER 11 HASH TABLE/HashTableSC.java:31
↓ 3 callersMethodadd
(int key, int value)
CHAPTER 11 HASH TABLE/HashTableLP.java:36
↓ 3 callersMethodadd
(String str)
CHAPTER 13 STRING ALGORITHMS/Trie.java:22
↓ 3 callersMethodadd
(String value)
CHAPTER 13 STRING ALGORITHMS/StringTree.java:24
↓ 3 callersMethodaddTail
(int value)
CHAPTER 6 LINKED LIST/DoublyCircularLinkedList.java:50
↓ 3 callersMethodcompare
(int[] arr, int first, int second)
CHAPTER 10 PRIORITY QUEUE & HEAPS/Heap.java:23
↓ 3 callersMethodcompareTo
(Edge compareEdge)
CHAPTER 12 GRAPHS/Graph.java:21
↓ 3 callersMethodcreateBinarySearchTree
(int[] arr)
CHAPTER 9 TREE/Tree.java:971
next →1–100 of 1,174, ranked by callers