Code
Hub
Workspaces
Following
Trending
Connect
MCP
copy
Create free account
hub
/
github.com/Seanforfun/Algorithm-and-Leetcode
/ functions
Functions
771 in github.com/Seanforfun/Algorithm-and-Leetcode
⨍
Functions
771
◇
Types & classes
203
Method
count
@Description: Number of cc in current graph. @return
DataStructrue/Graph/ConnectionComponent.java:15
Method
countWays
(int n)
Offer/ca/mcmaster/offer/Question9_1.java:4
Method
degree
@Description: Return degree of given vertex. @param G @param V @return
Algorithm(4th_Edition)/src/ca/mcmaster/chapter/four/graph/Graph.java:34
Method
degree
@Description: Return degree of given vertex. @param G @param V @return
DataStructrue/Graph/Graph.java:36
Method
delMax
@Description: Return and delete the max value from the priority queue. @return
Algorithm(4th_Edition)/src/ca/mcmaster/chapter/two/queue/MaxPriorityQueue.java:20
Method
delete
(K k)
Algorithm(4th_Edition)/src/ca/mcmaster/chapter/three/bitree/BinaryTreeSymbolTableAbstract.java:70
Method
delete
(Node n, K k)
Algorithm(4th_Edition)/Notes/Tree/BinaryTree.java:54
Method
delete
(Node n, K k)
DataStructrue/Tree/BinaryTree.java:54
Method
dequeueAny
()
Offer/ca/mcmaster/offer/Question3_7.java:38
Method
display
@Description: Print a graph.
Algorithm(4th_Edition)/src/ca/mcmaster/chapter/four/graph/Graph.java:82
Method
display
@Description: Print current graph.
Algorithm(4th_Edition)/src/ca/mcmaster/chapter/four/graph/directed/Digraph.java:34
Method
display
()
Offer/ca/mcmaster/offer/OfferStack.java:6
Method
display
()
DataStructrue/Graph/EdgeWeightedDigraph.java:47
Method
display
@Description: Print current graph.
DataStructrue/Graph/Digraph.java:34
Method
displayAfter
(ListNode<T> node)
Offer/ca/mcmaster/offer/OfferList.java:66
Method
distTo
@Description: The distance between w and v, if not connected, dist is infinity. @param v @return
Algorithm(4th_Edition)/src/ca/mcmaster/chapter/four/graph/spt/SP.java:9
Method
distTo
@Description: The distance between w and v, if not connected, dist is infinity. @param v @return
DataStructrue/Graph/SP.java:9
Method
edges
@Description: Find the edges on the minimum spanning tree. @return
Algorithm(4th_Edition)/src/ca/mcmaster/chapter/four/graph/mstree/MST.java:8
Method
edges
()
Algorithm(4th_Edition)/src/ca/mcmaster/chapter/four/graph/mstree/PrimMst.java:35
Method
edges
()
DataStructrue/Graph/PrimMst.java:35
Method
find
(int p)
Algorithm(4th_Edition)/src/ca/mcmaster/chapter/one/unionfind/QuickFind.java:19
Method
floor
(K k)
Algorithm(4th_Edition)/src/ca/mcmaster/chapter/three/bitree/BinaryTreeSymbolTableAbstract.java:31
Method
get
(K k)
Algorithm(4th_Edition)/src/ca/mcmaster/chapter/three/bitree/BinaryTreeSymbolTableAbstract.java:19
Method
get
(Node node, K k)
Algorithm(4th_Edition)/Notes/Tree/BinaryTree.java:28
Method
get
(Node node, K k)
DataStructrue/Tree/BinaryTree.java:28
Method
getClosestBigger
(int n)
Offer/ca/mcmaster/offer/Question5_3.java:4
Method
getDelay
(TimeUnit unit)
Algorithm(4th_Edition)/src/ca/mcmaster/queue/arrayblockingqueue/DelayMsg.java:36
Method
getDelay
(TimeUnit unit)
DataStructrue/Queue/DelayMsg.java:36
Method
getIndex
()
Offer/ca/mcmaster/offer/Question3_4.java:13
Method
getName
()
Algorithm(4th_Edition)/src/ca/mcmaster/chapter/one/MyMath.java:55
Method
getNode
(int index)
Offer/ca/mcmaster/offer/OfferList.java:36
Method
getPossibleOrders
(Box[] box, Box bottom, ArrayList<Box> order, boolean[] used, List<ArrayList<Box>> result)
Offer/ca/mcmaster/offer/Question9_10.java:17
Method
getValidParentheses
(int n)
Offer/ca/mcmaster/offer/Question9_6.java:9
Method
harmonicSeries
(int N)
Algorithm(4th_Edition)/src/ca/mcmaster/chapter/one/MyMath.java:23
Method
hasNext
()
Algorithm(4th_Edition)/src/ca/mcmaster/chapter/one/FIFO/ListFIFOQueue.java:37
Method
hasPathTo
@Description: If there is a path from s to v @param v @return
Algorithm(4th_Edition)/src/ca/mcmaster/chapter/four/graph/Path.java:9
Method
hasPathTo
(int v)
Algorithm(4th_Edition)/src/ca/mcmaster/chapter/four/graph/undirected/BreadthFirstPath.java:23
Method
hasPathTo
(int v)
Algorithm(4th_Edition)/src/ca/mcmaster/chapter/four/graph/directed/BreadFirstPathDirectedGraph.java:23
Method
hasPathTo
(int v)
Algorithm(4th_Edition)/src/ca/mcmaster/chapter/four/graph/directed/DepthFirstPathDirectedGraph.java:30
Method
hasPathTo
@Description: If there is a path from s to v. @param v @return
Algorithm(4th_Edition)/src/ca/mcmaster/chapter/four/graph/spt/SP.java:15
Method
hasPathTo
@Description: If there is a path from s to v @param v @return
DataStructrue/Graph/Path.java:9
Method
hasPathTo
(int v)
DataStructrue/Graph/BreadFirstPathDirectedGraph.java:23
Method
hasPathTo
@Description: If there is a path from s to v. @param v @return
DataStructrue/Graph/SP.java:15
Method
hasPathTo
(int v)
DataStructrue/Graph/BreadthFirstPath.java:21
Method
hasPathTo
(int v)
DataStructrue/Graph/DepthFirstPathDirectedGraph.java:30
Method
id
@Description: Identification of connection component. @param v @return
Algorithm(4th_Edition)/src/ca/mcmaster/chapter/four/graph/undirected/ConnectionComponent.java:21
Method
id
(int v)
Algorithm(4th_Edition)/src/ca/mcmaster/chapter/four/graph/directed/StrongCircleComponent.java:35
Method
id
@Description: Which of the strong component belongs to. @param v @return
Algorithm(4th_Edition)/src/ca/mcmaster/chapter/four/graph/directed/SCC.java:21
Method
id
(int v)
DataStructrue/Graph/StrongCircleComponent.java:35
Method
id
@Description: Which of the strong component belongs to. @param v @return
DataStructrue/Graph/SCC.java:21
Method
id
@Description: Identification of connection component. @param v @return
DataStructrue/Graph/ConnectionComponent.java:21
Method
index
@Description: Index of key. @param key @return
Algorithm(4th_Edition)/src/ca/mcmaster/chapter/four/graph/undirected/SymbolGraph.java:17
Method
index
@Description: Index of key. @param key @return
DataStructrue/Graph/SymbolGraph.java:15
Method
isBalance
(OfferTree.TreeNode root)
Offer/ca/mcmaster/offer/Question4_1.java:10
Method
isConnectDFS
(GraphVertex vertex)
Offer/ca/mcmaster/offer/OfferGraph.java:18
Method
isDAG
()
Algorithm(4th_Edition)/src/ca/mcmaster/chapter/four/graph/directed/Topological.java:19
Method
isDAG
()
DataStructrue/Graph/Topological.java:19
Method
isEmpty
()
Algorithm(4th_Edition)/src/ca/mcmaster/chapter/two/queue/MaxPriorityQueueBinaryStack.java:23
Method
isEmpty
@Description: Check if current queue is empty. @return
Algorithm(4th_Edition)/src/ca/mcmaster/chapter/two/queue/MaxPriorityQueue.java:26
Method
isEmpty
()
Algorithm(4th_Edition)/src/ca/mcmaster/chapter/one/bag/ListBag.java:19
Method
isEmpty
()
Algorithm(4th_Edition)/src/ca/mcmaster/chapter/one/stack/MyStack.java:6
Method
isEmpty
()
Algorithm(4th_Edition)/src/ca/mcmaster/chapter/one/FIFO/FifoQueue.java:6
Method
isPalindrome
(String s)
Algorithm(4th_Edition)/src/ca/mcmaster/chapter/one/MyString.java:6
Method
isPrime
(int N)
Algorithm(4th_Edition)/src/ca/mcmaster/chapter/one/MyMath.java:4
Method
isSorted
(Comparable[] a)
Algorithm(4th_Edition)/src/ca/mcmaster/chapter/two/Sort/SortOld.java:76
Method
isSorted
(String[] s)
Algorithm(4th_Edition)/src/ca/mcmaster/chapter/one/MyString.java:16
Method
iterator
()
Algorithm(4th_Edition)/src/ca/mcmaster/chapter/one/stack/ListStack.java:40
Method
iterator
()
Algorithm(4th_Edition)/src/ca/mcmaster/chapter/one/FIFO/ListFIFOQueue.java:32
Method
lastK
(int k)
Offer/ca/mcmaster/offer/OfferList.java:122
Method
main
(String[] args)
Algorithm(4th_Edition)/src/ca/mcmaster/chapter/three/BinarySearchST.java:27
Method
main
(String[] args)
Algorithm(4th_Edition)/src/ca/mcmaster/chapter/three/SequentialSearchST.java:36
Method
main
(String[] args)
Algorithm(4th_Edition)/src/ca/mcmaster/chapter/three/bitree/BinaryTreeSymbolTable.java:45
Method
main
(String[] args)
Algorithm(4th_Edition)/src/ca/mcmaster/chapter/three/bitree/BalancedBinaryTree.java:186
Method
main
(String[] args)
Algorithm(4th_Edition)/src/ca/mcmaster/chapter/two/Sort/SelectionSort.java:14
Method
main
(String[] args)
Algorithm(4th_Edition)/src/ca/mcmaster/chapter/two/Sort/SortOld.java:133
Method
main
(String[] args)
Algorithm(4th_Edition)/src/ca/mcmaster/chapter/two/Sort/BubbleSort.java:17
Method
main
(String[] args)
Algorithm(4th_Edition)/src/ca/mcmaster/chapter/two/Sort/InsertionSort.java:11
Method
main
(String[] args)
Algorithm(4th_Edition)/src/ca/mcmaster/chapter/two/queue/MaxPriorityQueueBinaryStack.java:43
Method
main
(String[] args)
Algorithm(4th_Edition)/src/ca/mcmaster/chapter/two/queue/HeapSort.java:31
Method
main
(String[] args)
Algorithm(4th_Edition)/src/ca/mcmaster/chapter/four/graph/undirected/DFSCC.java:45
Method
main
(String[] args)
Algorithm(4th_Edition)/src/ca/mcmaster/chapter/four/graph/undirected/DeepFirstSearch.java:32
Method
main
(String[] args)
Algorithm(4th_Edition)/src/ca/mcmaster/chapter/four/graph/undirected/SymbolGraphImpl.java:67
Method
main
(String[] args)
Algorithm(4th_Edition)/src/ca/mcmaster/chapter/four/graph/undirected/DepthFirstPath.java:48
Method
main
(String[] args)
Algorithm(4th_Edition)/src/ca/mcmaster/chapter/four/graph/undirected/UFSearch.java:65
Method
main
(String[] args)
Algorithm(4th_Edition)/src/ca/mcmaster/chapter/four/graph/undirected/BreadthFirstPath.java:53
Method
main
(String[] args)
Algorithm(4th_Edition)/src/ca/mcmaster/chapter/four/graph/directed/DirectedCycle.java:51
Method
main
(String[] args)
Algorithm(4th_Edition)/src/ca/mcmaster/chapter/four/graph/directed/Topological.java:22
Method
main
(String[] args)
Algorithm(4th_Edition)/src/ca/mcmaster/chapter/four/graph/directed/BreadFirstPathDirectedGraph.java:53
Method
main
(String[] args)
Algorithm(4th_Edition)/src/ca/mcmaster/chapter/four/graph/directed/DigraphImpl.java:73
Method
main
(String[] args)
Algorithm(4th_Edition)/src/ca/mcmaster/chapter/four/graph/directed/DepthFirstPathDirectedGraph.java:53
Method
main
(String[] args)
Algorithm(4th_Edition)/src/ca/mcmaster/chapter/four/graph/directed/DirectedDFS.java:29
Method
main
(String[] args)
Algorithm(4th_Edition)/src/ca/mcmaster/chapter/four/graph/mstree/KruskalMST.java:43
Method
main
(String[] args)
Algorithm(4th_Edition)/src/ca/mcmaster/chapter/four/graph/mstree/LazyPrimMST.java:46
Method
main
(String[] args)
Algorithm(4th_Edition)/src/ca/mcmaster/chapter/four/graph/mstree/EdgeWeightedGraph.java:63
Method
main
(String[] args)
Algorithm(4th_Edition)/src/ca/mcmaster/chapter/four/graph/spt/EdgeWeightedDigraph.java:60
Method
main
(String[] args)
Algorithm(4th_Edition)/src/ca/mcmaster/chapter/four/graph/spt/DijkstraSP.java:72
Method
main
(String[] args)
Algorithm(4th_Edition)/src/ca/mcmaster/chapter/one/MyString.java:27
Method
main
(String[] args)
Algorithm(4th_Edition)/src/ca/mcmaster/chapter/one/Evaluate.java:6
Method
main
(String[] args)
Algorithm(4th_Edition)/src/ca/mcmaster/chapter/one/MyMath.java:40
Method
main
(String[] args)
Algorithm(4th_Edition)/src/ca/mcmaster/chapter/one/BinarySearch.java:22
← previous
next →
501–600 of 771, ranked by callers