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
↓ 2 callersMethoddisplay
()
Offer/ca/mcmaster/offer/OfferList.java:58
↓ 2 callersMethoddistTo
(int v)
Algorithm(4th_Edition)/src/ca/mcmaster/chapter/four/graph/spt/DijkstraSP.java:25
↓ 2 callersMethoddistTo
(int v)
DataStructrue/Graph/DijkstraSP.java:25
↓ 2 callersMethoddoubleRotateLR
@Description: LR造成的不平衡，需要两次旋转。 @param n @return
Algorithm(4th_Edition)/src/ca/mcmaster/chapter/three/bitree/BalancedBinaryTree.java:60
↓ 2 callersMethoddoubleRotateRL
@Description: RL造成的不平衡，两次旋转。 @param n @return
Algorithm(4th_Edition)/src/ca/mcmaster/chapter/three/bitree/BalancedBinaryTree.java:70
↓ 2 callersMethodeither
()
DataStructrue/Graph/Edge.java:21
↓ 2 callersMethodfind
(int p)
Algorithm(4th_Edition)/src/ca/mcmaster/chapter/one/unionfind/WeightedUnionFind.java:29
↓ 2 callersMethodfind
(int p)
Algorithm(4th_Edition)/src/ca/mcmaster/chapter/one/unionfind/UnionFind.java:5
↓ 2 callersMethodfind
(int p)
Algorithm(4th_Edition)/src/ca/mcmaster/chapter/one/unionfind/QuickUnion.java:18
↓ 2 callersMethodgetHeight
(OfferTree.TreeNode root)
Offer/ca/mcmaster/offer/Question4_1.java:6
↓ 2 callersMethodhasCycle
()
Algorithm(4th_Edition)/src/ca/mcmaster/chapter/four/graph/directed/DirectedCycle.java:43
↓ 2 callersMethodhasCycle
()
DataStructrue/Graph/DirectedCycle.java:43
↓ 2 callersMethodhasNext
()
Algorithm(4th_Edition)/src/ca/mcmaster/chapter/one/bag/ListBag.java:26
↓ 2 callersMethodindex
(String key)
Algorithm(4th_Edition)/src/ca/mcmaster/chapter/four/graph/undirected/SymbolGraphImpl.java:58
↓ 2 callersMethodindex
(String key)
DataStructrue/Graph/SymbolGraphImpl.java:56
↓ 2 callersMethodisEmpty
()
Algorithm(4th_Edition)/src/ca/mcmaster/chapter/one/stack/ResizingArrayStack.java:21
↓ 2 callersMethodisFree
(int x, int y)
Offer/ca/mcmaster/offer/Question9_2.java:34
↓ 2 callersMethodisFull
()
Offer/ca/mcmaster/offer/SetOfStack.java:18
↓ 2 callersMethodless
(Comparable<T>[] a, int i, int j)
Algorithm(4th_Edition)/src/ca/mcmaster/chapter/two/Sort/Sort.java:9
↓ 2 callersMethodless
(Comparable[] a,int i, int j)
Algorithm(4th_Edition)/src/ca/mcmaster/chapter/two/queue/HeapSort.java:4
↓ 2 callersMethodless
(Integer i, Integer j)
Algorithm(4th_Edition)/Notes/Tree/CompleteBinaryTree.java:12
↓ 2 callersMethodless
(Integer i, Integer j)
DataStructrue/Tree/CompleteBinaryTree.java:12
↓ 2 callersMethodmatchTree
(TreeNode node1, TreeNode node2)
Offer/ca/mcmaster/offer/OfferTree.java:168
↓ 2 callersMethodmerge
(Comparable[] a, int lo, int mid, int hi)
Algorithm(4th_Edition)/src/ca/mcmaster/chapter/two/Sort/SortOld.java:81
↓ 2 callersMethodmin
()
Algorithm(4th_Edition)/src/ca/mcmaster/chapter/three/bitree/BinaryTreeSymbolTableAbstract.java:21
↓ 2 callersMethodmin
()
Offer/ca/mcmaster/offer/StackWithMin.java:37
↓ 2 callersMethodnext
()
Algorithm(4th_Edition)/src/ca/mcmaster/chapter/one/stack/ListStack.java:46
↓ 2 callersMethodpathTo
(int v)
Algorithm(4th_Edition)/src/ca/mcmaster/chapter/four/graph/undirected/BreadthFirstPath.java:28
↓ 2 callersMethodpathTo
(int v)
Algorithm(4th_Edition)/src/ca/mcmaster/chapter/four/graph/directed/DepthFirstPathDirectedGraph.java:34
↓ 2 callersMethodpathTo
(int v)
DataStructrue/Graph/BreadthFirstPath.java:26
↓ 2 callersMethodpathTo
(int v)
DataStructrue/Graph/DepthFirstPathDirectedGraph.java:34
↓ 2 callersMethodpreOrder
(TreeNode node, StringBuilder sb)
Offer/ca/mcmaster/offer/OfferTree.java:155
↓ 2 callersMethodpush
(int v)
Offer/ca/mcmaster/offer/StackWithMin.java:22
↓ 2 callersMethodreverse
@Description: Get the reverse graph of current graph. @return
DataStructrue/Graph/Digraph.java:30
↓ 2 callersMethodreversePost
()
Algorithm(4th_Edition)/src/ca/mcmaster/chapter/four/graph/directed/DepthFirstOrder.java:35
↓ 2 callersMethodreversePost
()
DataStructrue/Graph/DepthFirstOrder.java:35
↓ 2 callersMethodsetName
(String name)
Algorithm(4th_Edition)/src/ca/mcmaster/chapter/one/MyMath.java:58
↓ 2 callersMethodshow
(Comparable[] a)
Algorithm(4th_Edition)/src/ca/mcmaster/chapter/two/Sort/Sort.java:18
↓ 2 callersMethodsink
(Comparable[] a, int k, int length)
Algorithm(4th_Edition)/src/ca/mcmaster/chapter/two/queue/HeapSort.java:6
↓ 2 callersMethodsize
@Description: Return the number of the elements left in the queue. @return
Algorithm(4th_Edition)/src/ca/mcmaster/chapter/two/queue/MaxPriorityQueue.java:32
↓ 2 callersMethodsort
(Comparable<T>[] a)
Algorithm(4th_Edition)/src/ca/mcmaster/chapter/two/Sort/SelectionSort.java:5
↓ 2 callersMethodswap
(Comparable[] a, int i, int j)
Algorithm(4th_Edition)/src/ca/mcmaster/chapter/two/Sort/Sort.java:13
↓ 2 callersMethodswap
(Comparable[] a, int i, int j)
Algorithm(4th_Edition)/src/ca/mcmaster/chapter/two/queue/HeapSort.java:5
↓ 2 callersMethodtoString
()
Algorithm(4th_Edition)/src/ca/mcmaster/chapter/four/graph/spt/DirectedEdge.java:15
↓ 2 callersMethodunion
(int p,int q)
Algorithm(4th_Edition)/src/ca/mcmaster/chapter/one/unionfind/UnionFind.java:4
↓ 1 callersMethodG
()
Algorithm(4th_Edition)/src/ca/mcmaster/chapter/four/graph/undirected/SymbolGraphImpl.java:64
↓ 1 callersMethodG
()
DataStructrue/Graph/SymbolGraphImpl.java:62
↓ 1 callersMethodV
@Description: Get the vertex number. @return
Algorithm(4th_Edition)/src/ca/mcmaster/chapter/four/graph/Graph.java:8
↓ 1 callersMethodV
()
Algorithm(4th_Edition)/src/ca/mcmaster/chapter/four/graph/undirected/UndirectedGraph.java:37
↓ 1 callersMethodV
()
Algorithm(4th_Edition)/src/ca/mcmaster/chapter/four/graph/directed/DigraphImpl.java:42
↓ 1 callersMethodV
()
DataStructrue/Graph/UndirectedGraph.java:35
↓ 1 callersMethodV
()
DataStructrue/Graph/DigraphImpl.java:42
↓ 1 callersMethodaddEdge
(int v, int w)
Algorithm(4th_Edition)/src/ca/mcmaster/chapter/four/graph/undirected/UndirectedGraph.java:41
↓ 1 callersMethodaddEdge
(int v, int w)
Algorithm(4th_Edition)/src/ca/mcmaster/chapter/four/graph/directed/DigraphImpl.java:44
↓ 1 callersMethodaddEdge
(Edge e)
Algorithm(4th_Edition)/src/ca/mcmaster/chapter/four/graph/mstree/EdgeWeightedGraph.java:39
↓ 1 callersMethodaddEdge
(int v, int w, double weight)
Algorithm(4th_Edition)/src/ca/mcmaster/chapter/four/graph/spt/EdgeWeightedDigraph.java:45
↓ 1 callersMethodaddEdge
(int v, int w, double weight)
DataStructrue/Graph/EdgeWeightedDigraph.java:40
↓ 1 callersMethodaddEdge
(int v, int w)
DataStructrue/Graph/UndirectedGraph.java:39
↓ 1 callersMethodaddEdge
(Edge e)
DataStructrue/Graph/EdgeWeightedGraph.java:39
↓ 1 callersMethodaddEdge
(int v, int w)
DataStructrue/Graph/DigraphImpl.java:44
↓ 1 callersMethodaddition
(ListNode<Integer> node1, ListNode<Integer> node2)
Offer/ca/mcmaster/offer/OfferList.java:160
↓ 1 callersMethodadj
@Description: Get all vertex adjacent to v. @param v @return
Algorithm(4th_Edition)/src/ca/mcmaster/chapter/four/graph/Graph.java:26
↓ 1 callersMethodadj
(int v)
Algorithm(4th_Edition)/src/ca/mcmaster/chapter/four/graph/directed/DigraphImpl.java:51
↓ 1 callersMethodadj
(int v)
DataStructrue/Graph/DigraphImpl.java:51
↓ 1 callersMethodbacktrace
(List<String> list, String s, int left, int right)
Offer/ca/mcmaster/offer/Question9_6.java:45
↓ 1 callersMethodbfs
(Graph g, int s)
Algorithm(4th_Edition)/src/ca/mcmaster/chapter/four/graph/undirected/BreadthFirstPath.java:38
↓ 1 callersMethodbfs
(Digraph g, int s)
Algorithm(4th_Edition)/src/ca/mcmaster/chapter/four/graph/directed/BreadFirstPathDirectedGraph.java:38
↓ 1 callersMethodbfs
(Digraph g, int s)
DataStructrue/Graph/BreadFirstPathDirectedGraph.java:38
↓ 1 callersMethodbfs
(Graph g, int s)
DataStructrue/Graph/BreadthFirstPath.java:36
↓ 1 callersMethodbitNeedSwap1
(int a, int b)
Offer/ca/mcmaster/offer/Question5_5.java:13
↓ 1 callersMethodcall
(Test t)
Algorithm(4th_Edition)/src/ca/mcmaster/chapter/one/MyMath.java:31
↓ 1 callersMethodcanBecome
(String a, String b)
Offer/ca/mcmaster/offer/Question1_3.java:6
↓ 1 callersMethodcanPutAbove
(Box b1, Box b2)
Offer/ca/mcmaster/offer/Question9_10.java:39
↓ 1 callersMethodcheckBSTBFS
(TreeNode root)
Offer/ca/mcmaster/offer/OfferTree.java:95
↓ 1 callersMethodcheckBSTDFS
(TreeNode root)
Offer/ca/mcmaster/offer/OfferTree.java:79
↓ 1 callersMethodcheckHeight
(OfferTree.TreeNode root)
Offer/ca/mcmaster/offer/Question4_1.java:17
↓ 1 callersMethodcheckSubtree
(TreeNode root, TreeNode node)
Offer/ca/mcmaster/offer/OfferTree.java:176
↓ 1 callersMethodclosestSameNode
(TreeNode root, TreeNode p, TreeNode q)
Offer/ca/mcmaster/offer/OfferTree.java:133
↓ 1 callersMethodcommonAncester
(TreeNode root, TreeNode p, TreeNode q)
Offer/ca/mcmaster/offer/OfferTree.java:151
↓ 1 callersMethodcompress
(String str)
Offer/ca/mcmaster/offer/Question1_5.java:4
↓ 1 callersMethodcontains
(K k)
Algorithm(4th_Edition)/src/ca/mcmaster/chapter/three/SearchSTAbstract.java:65
↓ 1 callersMethodcount
()
Algorithm(4th_Edition)/src/ca/mcmaster/chapter/four/graph/undirected/DFSCC.java:29
↓ 1 callersMethodcount
()
Algorithm(4th_Edition)/src/ca/mcmaster/chapter/four/graph/undirected/DeepFirstSearch.java:27
↓ 1 callersMethodcount
()
DataStructrue/Graph/DFSCC.java:28
↓ 1 callersMethodcount
()
DataStructrue/Graph/DeepFirstSearch.java:25
↓ 1 callersMethodcountWaysDP
(int n)
Offer/ca/mcmaster/offer/Question9_1.java:13
↓ 1 callersMethodcreateLevelList
(TreeNode root, List<LinkedList<TreeNode>> list, int level)
Offer/ca/mcmaster/offer/OfferTree.java:46
↓ 1 callersMethodcreatePathTable
(TreeNode root, List<LinkedList<PathResult>> lists)
Offer/ca/mcmaster/offer/OfferTree.java:192
↓ 1 callersMethodcycle
()
Algorithm(4th_Edition)/src/ca/mcmaster/chapter/four/graph/directed/DirectedCycle.java:47
↓ 1 callersMethodcycle
()
DataStructrue/Graph/DirectedCycle.java:47
↓ 1 callersMethoddelMax
()
Algorithm(4th_Edition)/src/ca/mcmaster/chapter/two/queue/MaxPriorityQueueBinaryStack.java:16
↓ 1 callersMethoddelMax
()
Algorithm(4th_Edition)/Notes/Tree/CompleteBinaryTree.java:42
↓ 1 callersMethoddelMax
()
DataStructrue/Tree/CompleteBinaryTree.java:42
↓ 1 callersMethoddelete
(K k)
Algorithm(4th_Edition)/src/ca/mcmaster/chapter/three/SearchSTAbstract.java:35
↓ 1 callersMethoddeleteMin
()
Algorithm(4th_Edition)/Notes/Tree/BinaryTree.java:38
↓ 1 callersMethoddeleteMin
()
DataStructrue/Tree/BinaryTree.java:38
↓ 1 callersMethoddequeue
()
Algorithm(4th_Edition)/src/ca/mcmaster/chapter/one/FIFO/ListFIFOQueue.java:22
↓ 1 callersMethoddequeueCat
()
Offer/ca/mcmaster/offer/Question3_7.java:35
↓ 1 callersMethoddfs
(Graph g, int v)
Algorithm(4th_Edition)/src/ca/mcmaster/chapter/four/graph/undirected/DFSCC.java:37
↓ 1 callersMethoddfs
(Graph g, int v)
Algorithm(4th_Edition)/src/ca/mcmaster/chapter/four/graph/undirected/DeepFirstSearch.java:17
← previousnext →101–200 of 771, ranked by callers