MCPcopy Create free account

hub / github.com/Seanforfun/Algorithm-and-Leetcode / functions

Functions771 in github.com/Seanforfun/Algorithm-and-Leetcode

⨍ Functions 771◇ Types & classes 203
↓ 75 callersMethodV
@Description: Get the vertex number. @return
DataStructrue/Graph/Graph.java:10
↓ 70 callersMethodadd
(T t)
Algorithm(4th_Edition)/src/ca/mcmaster/chapter/one/bag/Bag.java:4
↓ 29 callersMethodadj
@Description: Get all vertex adjacent to v. @param v @return
DataStructrue/Graph/Graph.java:28
↓ 29 callersMethodcompareTo
(Edge o)
Algorithm(4th_Edition)/src/ca/mcmaster/chapter/four/graph/mstree/Edge.java:12
↓ 28 callersMethodheight
(AVLNode n)
Algorithm(4th_Edition)/src/ca/mcmaster/chapter/three/bitree/BalancedBinaryTree.java:22
↓ 26 callersMethodpush
(int v)
Offer/ca/mcmaster/offer/SetOfStack.java:24
↓ 22 callersMethodprint
()
Offer/ca/mcmaster/offer/Question9_2.java:14
↓ 19 callersMethodisEmpty
()
Algorithm(4th_Edition)/src/ca/mcmaster/chapter/one/bag/Bag.java:5
↓ 16 callersMethodaddLeftChild
(TreeNode child)
Offer/ca/mcmaster/offer/OfferTree.java:29
↓ 16 callersMethodaddRightChild
(TreeNode child)
Offer/ca/mcmaster/offer/OfferTree.java:33
↓ 16 callersMethodtoString
()
DataStructrue/Graph/Edge.java:28
↓ 15 callersMethodoffer
(E e)
Offer/ca/mcmaster/offer/MyQueue.java:12
↓ 15 callersMethodweight
@Description: Return the total weight of the tree. @return
DataStructrue/Graph/MST.java:13
↓ 13 callersMethodpop
()
Offer/ca/mcmaster/offer/SetOfStack.java:29
↓ 12 callersMethodpoll
()
Offer/ca/mcmaster/offer/MyQueue.java:15
↓ 12 callersMethodpush
(T t)
Algorithm(4th_Edition)/src/ca/mcmaster/chapter/one/stack/MyStack.java:4
↓ 11 callersMethodadd
(T t)
Algorithm(4th_Edition)/src/ca/mcmaster/chapter/one/bag/ListBag.java:12
↓ 11 callersMethodcontains
@Description: Is key a vertex. @param key @return
DataStructrue/Graph/SymbolGraph.java:9
↓ 11 callersMethodpop
()
Algorithm(4th_Edition)/src/ca/mcmaster/chapter/one/stack/MyStack.java:5
↓ 11 callersMethodput
(Node node, K k, V v)
DataStructrue/Tree/BinaryTree.java:16
↓ 11 callersMethodsize
()
Algorithm(4th_Edition)/src/ca/mcmaster/chapter/one/bag/Bag.java:6
↓ 10 callersMethodadd
(T t)
Offer/ca/mcmaster/offer/OfferList.java:20
↓ 10 callersMethodconnect
(GraphVertex v1, GraphVertex v2)
Offer/ca/mcmaster/offer/OfferGraph.java:51
↓ 10 callersMethodtoString
()
Algorithm(4th_Edition)/src/ca/mcmaster/chapter/four/graph/mstree/Edge.java:29
↓ 9 callersMethodget
(K k)
Algorithm(4th_Edition)/src/ca/mcmaster/chapter/three/SearchSTAbstract.java:14
↓ 9 callersMethodmax
@Description: Return the max value from the priority queue. @return
Algorithm(4th_Edition)/src/ca/mcmaster/chapter/two/queue/MaxPriorityQueue.java:14
↓ 8 callersMethodenqueue
(T t)
Algorithm(4th_Edition)/src/ca/mcmaster/chapter/one/FIFO/FifoQueue.java:4
↓ 8 callersMethodget
(int i)
DataStructrue/Tree/CompleteBinaryTree.java:29
↓ 8 callersMethodless
(Comparable a, Comparable b)
Algorithm(4th_Edition)/src/ca/mcmaster/chapter/two/Sort/SortOld.java:62
↓ 8 callersMethodpush
(Integer v, int index)
Offer/ca/mcmaster/offer/OfferStack.java:18
↓ 8 callersMethodput
(K k, V v)
Algorithm(4th_Edition)/src/ca/mcmaster/chapter/three/rbtree/RedBlackBST.java:55
↓ 7 callersMethodbinarySearch
(K k)
Algorithm(4th_Edition)/src/ca/mcmaster/chapter/three/SearchSTAbstract.java:34
↓ 7 callersMethodcompareTo
(Edge o)
DataStructrue/Graph/Edge.java:12
↓ 7 callersMethodinsert
(T t)
Algorithm(4th_Edition)/src/ca/mcmaster/chapter/two/queue/MaxPriorityQueueBinaryStack.java:9
↓ 7 callersMethodput
(K k, V v)
Algorithm(4th_Edition)/src/ca/mcmaster/chapter/three/bitree/BinaryTreeSymbolTable.java:17
↓ 7 callersMethodput
(Node node, K k, V v)
Algorithm(4th_Edition)/Notes/Tree/BinaryTree.java:16
↓ 7 callersMethodsize
(Node x)
Algorithm(4th_Edition)/src/ca/mcmaster/chapter/three/bitree/BinaryTreeSymbolTableAbstract.java:14
↓ 7 callersMethodsize
()
Algorithm(4th_Edition)/src/ca/mcmaster/chapter/three/rbtree/RedBlackBST.java:45
↓ 7 callersMethodswap
(Comparable[] a, int i, int j)
Algorithm(4th_Edition)/src/ca/mcmaster/chapter/two/Sort/SortOld.java:65
↓ 6 callersMethodconnected
(int p, int q)
Algorithm(4th_Edition)/src/ca/mcmaster/chapter/one/unionfind/UnionFind.java:6
↓ 6 callersMethodget
(K k)
Algorithm(4th_Edition)/src/ca/mcmaster/chapter/three/SequentialSearchST.java:15
↓ 6 callersMethodhasNext
()
Algorithm(4th_Edition)/src/ca/mcmaster/chapter/one/stack/ListStack.java:44
↓ 6 callersMethodinsert
@Description: Insert an element into the priority queue @param t
Algorithm(4th_Edition)/src/ca/mcmaster/chapter/two/queue/MaxPriorityQueue.java:8
↓ 6 callersMethodinsert
(K k)
Algorithm(4th_Edition)/Notes/Tree/CompleteBinaryTree.java:22
↓ 6 callersMethodinsert
(K k, V v)
DataStructrue/Tree/BlackRedTree.java:73
↓ 6 callersMethodinsert
(K k)
DataStructrue/Tree/CompleteBinaryTree.java:22
↓ 6 callersMethodisRed
(Node node)
Algorithm(4th_Edition)/src/ca/mcmaster/chapter/three/rbtree/RedBlackBST.java:21
↓ 6 callersMethodisRed
(Node n)
DataStructrue/Tree/BlackRedTree.java:21
↓ 6 callersMethodother
(int v)
Algorithm(4th_Edition)/src/ca/mcmaster/chapter/four/graph/mstree/Edge.java:24
↓ 6 callersMethodsize
(Node x)
DataStructrue/Tree/BlackRedTree.java:25
↓ 5 callersMethoddelMin
()
Algorithm(4th_Edition)/src/ca/mcmaster/chapter/three/bitree/BinaryTreeSymbolTableAbstract.java:63
↓ 5 callersMethodinsert
(V v)
Algorithm(4th_Edition)/src/ca/mcmaster/chapter/three/bitree/BalancedBinaryTree.java:75
↓ 5 callersMethodother
(int v)
DataStructrue/Graph/Edge.java:24
↓ 5 callersMethodpop
(int index)
Offer/ca/mcmaster/offer/OfferStack.java:25
↓ 5 callersMethodpush
(T t)
Algorithm(4th_Edition)/src/ca/mcmaster/chapter/one/stack/ListStack.java:12
↓ 5 callersMethodput
(K k, V v)
Algorithm(4th_Edition)/src/ca/mcmaster/chapter/three/SequentialSearchST.java:24
↓ 5 callersMethodto
()
Algorithm(4th_Edition)/src/ca/mcmaster/chapter/four/graph/spt/DirectedEdge.java:14
↓ 5 callersMethodto
()
DataStructrue/Graph/DirectedEdge.java:14
↓ 4 callersMethoddequeue
()
Algorithm(4th_Edition)/src/ca/mcmaster/chapter/one/FIFO/FifoQueue.java:5
↓ 4 callersMethoddisplay
@Description: Print a graph.
DataStructrue/Graph/Graph.java:84
↓ 4 callersMethodenqueue
(Animal animal)
Offer/ca/mcmaster/offer/Question3_7.java:25
↓ 4 callersMethodfind
(int v)
Algorithm(4th_Edition)/src/ca/mcmaster/chapter/four/graph/undirected/UFSearch.java:44
↓ 4 callersMethodfind
(int v)
DataStructrue/Graph/UFSearch.java:41
↓ 4 callersMethodget
(int index)
Offer/ca/mcmaster/offer/OfferList.java:26
↓ 4 callersMethodgetLastStack
()
Offer/ca/mcmaster/offer/SetOfStack.java:42
↓ 4 callersMethodhasChild
(TreeNode root, TreeNode node)
Offer/ca/mcmaster/offer/OfferTree.java:128
↓ 4 callersMethodsingleRotateLeft
@Description: RR插入造成不平衡，通过单次向左旋转重新平衡树。 @param n @return
Algorithm(4th_Edition)/src/ca/mcmaster/chapter/three/bitree/BalancedBinaryTree.java:46
↓ 4 callersMethodsingleRotateRight
@Description: LL插入造成不平衡，通过单次向右旋转重新平衡树。 @param n @return
Algorithm(4th_Edition)/src/ca/mcmaster/chapter/three/bitree/BalancedBinaryTree.java:32
↓ 4 callersMethodsize
(Node n)
Algorithm(4th_Edition)/Notes/Tree/BinaryTree.java:10
↓ 4 callersMethodsize
(Node n)
DataStructrue/Tree/BinaryTree.java:10
↓ 4 callersMethodsort
@Description: Sort the array in a descent order. @param a: array to sort
Algorithm(4th_Edition)/src/ca/mcmaster/chapter/two/Sort/Sort.java:8
↓ 3 callersMethodclone
()
Offer/ca/mcmaster/offer/OfferTree.java:217
↓ 3 callersMethodcount
()
Algorithm(4th_Edition)/src/ca/mcmaster/chapter/one/unionfind/UnionFind.java:7
↓ 3 callersMethodeither
()
Algorithm(4th_Edition)/src/ca/mcmaster/chapter/four/graph/mstree/Edge.java:21
↓ 3 callersMethodenqueue
(T t)
Algorithm(4th_Edition)/src/ca/mcmaster/chapter/one/FIFO/ListFIFOQueue.java:13
↓ 3 callersMethodfrom
()
Algorithm(4th_Edition)/src/ca/mcmaster/chapter/four/graph/spt/DirectedEdge.java:13
↓ 3 callersMethodfrom
()
DataStructrue/Graph/DirectedEdge.java:13
↓ 3 callersMethodisEmpty
()
Algorithm(4th_Edition)/src/ca/mcmaster/chapter/one/FIFO/ListFIFOQueue.java:30
↓ 3 callersMethodisEmpty
()
Offer/ca/mcmaster/offer/SetOfStack.java:21
↓ 3 callersMethoditerator
()
Algorithm(4th_Edition)/src/ca/mcmaster/chapter/one/bag/ListBag.java:21
↓ 3 callersMethodless
(int i, int j)
Algorithm(4th_Edition)/src/ca/mcmaster/chapter/two/queue/MaxPriorityQueueBinaryStack.java:25
↓ 3 callersMethodname
(int v)
Algorithm(4th_Edition)/src/ca/mcmaster/chapter/four/graph/undirected/SymbolGraphImpl.java:61
↓ 3 callersMethodname
(int v)
DataStructrue/Graph/SymbolGraphImpl.java:59
↓ 3 callersMethodresize
(int capacity)
Algorithm(4th_Edition)/src/ca/mcmaster/chapter/one/stack/ResizingArrayStack.java:23
↓ 3 callersMethodswap
(int i, int j)
Algorithm(4th_Edition)/src/ca/mcmaster/chapter/two/queue/MaxPriorityQueueBinaryStack.java:26
↓ 3 callersMethodswap
(int i, int j)
Algorithm(4th_Edition)/Notes/Tree/CompleteBinaryTree.java:7
↓ 3 callersMethodswap
(int i, int j)
DataStructrue/Tree/CompleteBinaryTree.java:7
↓ 3 callersMethodunion
(int p, int q)
Algorithm(4th_Edition)/src/ca/mcmaster/chapter/one/unionfind/QuickFind.java:11
↓ 3 callersMethodvisit
(EdgeWeightedGraph g, int v)
Algorithm(4th_Edition)/src/ca/mcmaster/chapter/four/graph/mstree/LazyPrimMST.java:41
↓ 3 callersMethodvisit
(EdgeWeightedGraph g, int v)
DataStructrue/Graph/LazyPrimMST.java:41
↓ 2 callersMethodaddEdge
@Description: Create an edge between w and v. @param v @param w
DataStructrue/Graph/Graph.java:22
↓ 2 callersMethodarrToTree
(Integer[] arr, int low, int high)
Offer/ca/mcmaster/offer/OfferTree.java:38
↓ 2 callersMethodbinarySearch
(K k)
Algorithm(4th_Edition)/src/ca/mcmaster/chapter/three/BinarySearchST.java:7
↓ 2 callersMethodconnected
@Description: If v and w are connected. @param v @param w @return
DataStructrue/Graph/ConnectionComponent.java:10
↓ 2 callersMethoddelete
(V v)
Algorithm(4th_Edition)/src/ca/mcmaster/chapter/three/bitree/BalancedBinaryTree.java:137
↓ 2 callersMethoddequeueDog
()
Offer/ca/mcmaster/offer/Question3_7.java:32
↓ 2 callersMethoddfs
(DigraphImpl g, int v)
Algorithm(4th_Edition)/src/ca/mcmaster/chapter/four/graph/directed/DepthFirstPathDirectedGraph.java:44
↓ 2 callersMethoddfs
(Digraph g, int s)
Algorithm(4th_Edition)/src/ca/mcmaster/chapter/four/graph/directed/DirectedDFS.java:21
↓ 2 callersMethoddfs
(DigraphImpl g, int v)
DataStructrue/Graph/DepthFirstPathDirectedGraph.java:44
↓ 2 callersMethoddfs
(Digraph g, int s)
DataStructrue/Graph/DirectedDFS.java:21
next →1–100 of 771, ranked by callers