Code
Hub
Workspaces
Following
Trending
Connect
MCP
copy
Create free account
hub
/
github.com/bighuang624/Algorithms-notes
/ types & classes
Types & classes
151 in github.com/bighuang624/Algorithms-notes
⨍
Functions
794
◇
Types & classes
151
Class
Accumulator
code/chapter1_2_Data_Abstraction/Accumulator.java:3
Class
AccumulatorTest
code/chapter1_2_Data_Abstraction/AccumulatorTest.java:6
Class
Alphabet
code/algs4/Alphabet.java:17
Class
Atan2Order
code/algs4/Point2D.java:236
Class
BST
code/chapter3_2_Binary_Search_Trees/BST.java:5
Class
Bag
The {@code Bag} class represents a bag (or multiset) of generic items. It supports insertion and iterating over the items in arbitrary order. <p>
code/algs4/Bag.java:54
Class
BinarySearch
The {@code BinarySearch} class provides a static method for binary searching for an integer in a sorted array of integers. <p> The <em>indexOf</em>
code/algs4/BinarySearch.java:42
Class
BinarySearch
二分查找 @author huang
code/chapter1_1_Programming_Model/BinarySearch.java:10
Class
BinarySearchST
code/chapter3_1_Symbol_Tables/BinarySearchST.java:5
Class
BinaryStdIn
<i>Binary standard input</i>. This class provides methods for reading in bits from standard input, either one bit at a time (as a {@code boolean}),
code/algs4/BinaryStdIn.java:38
Class
BinaryStdOut
<i>Binary standard output</i>. This class provides methods for converting primtive type variables ({@code boolean}, {@code byte}, {@code char}, {@co
code/algs4/BinaryStdOut.java:35
Class
BouncingBall
code/chapter1_1_Programming_Model/BouncingBall.java:5
Class
BoyerMoore
@author huang Boyer-Moore 字符串查找算法(启发式地处理不匹配地字符)
code/chapter5_3_Substring_Search/BoyerMoore.java:9
Class
BreadthFirstPaths
code/chapter4_1_Undirected_Graphs/BreadthFirstPaths.java:6
Class
CC
查找连通分量 @author huang
code/chapter4_1_Undirected_Graphs/CC.java:7
Class
Cat
code/chapter1_2_Data_Abstraction/Cat.java:6
Class
Counter
The {@code Counter} class is a mutable data type to encapsulate a counter. <p> For additional documentation, see <a href="http://algs4.cs.princeton
code/algs4/Counter.java:33
Class
Cycle
利用深度优先,判断 G 是否是无向图(假设不存在自环或平行边) @author huang
code/chapter4_1_Undirected_Graphs/Cycle.java:7
Class
Date
code/chapter1_2_Data_Abstraction/Date.java:3
Class
DegreesOfSeparation
间隔的度数 @author huang
code/chapter4_1_Undirected_Graphs/DegreesOfSeparation.java:10
Class
DepthFirstOrder
code/chapter4_2_Directed_Graphs/DepthFirstOrder.java:6
Class
DepthFirstPaths
edgeTo[w]=v 表示 v-w 是第一次访问 w 时经过的边 edgeTo[] 数组是一颗用父链接表示的以 s 为根且含有所有与 s 连通的顶点的树 @author huang
code/chapter4_1_Undirected_Graphs/DepthFirstPaths.java:10
Class
DepthFirstSearch
code/chapter4_1_Undirected_Graphs/DepthFirstSearch.java:3
Class
Digraph
code/chapter4_2_Directed_Graphs/Digraph.java:6
Class
DijkstraSP
@author huang 最短路径的 Dijkstra 算法
code/chapter4_4_Shortest_Paths/DijkstraSP.java:10
Class
DirectedCycle
code/chapter4_2_Directed_Graphs/DirectedCycle.java:5
Class
DirectedDFS
code/chapter4_2_Directed_Graphs/DirectedDFS.java:10
Class
DirectedEdge
@author huang 加权有向边的数据类型
code/chapter4_4_Shortest_Paths/DirectedEdge.java:7
Class
DistanceToOrder
code/algs4/Point2D.java:268
Class
DoublingRatio
code/chapter1_4_Analysis_of_Algorithms/DoublingRatio.java:6
Class
DoublingTest
code/chapter1_4_Analysis_of_Algorithms/DoublingTest.java:6
Class
Draw
<i>Draw</i>. This class provides a basic capability for creating drawings with your programs. It uses a simple graphics model that allows you to cre
code/algs4/Draw.java:89
Interface
DrawListener
code/algs4/DrawListener.java:11
Class
Edge
code/chapter4_3_Minimum_Spanning_Tree/Edge.java:6
Class
EdgeWeightedDigraph
@author huang 加权有向图的数据类型
code/chapter4_4_Shortest_Paths/EdgeWeightedDigraph.java:10
Class
EdgeWeightedGraph
code/chapter4_3_Minimum_Spanning_Tree/EdgeWeightedGraph.java:9
Class
Ex1
code/chapter1_1_Programming_Model/Ex1.java:5
Class
Ex10
code/chapter1_1_Programming_Model/Ex10.java:5
Class
Ex11
code/chapter1_1_Programming_Model/Ex11.java:6
Class
Ex13
code/chapter1_1_Programming_Model/Ex13.java:6
Class
Ex14
code/chapter1_1_Programming_Model/Ex14.java:5
Class
Ex15
code/chapter1_1_Programming_Model/Ex15.java:5
Class
Ex19
code/chapter1_1_Programming_Model/Ex19.java:5
Class
Ex2
code/chapter1_1_Programming_Model/Ex2.java:5
Class
Ex20
code/chapter1_1_Programming_Model/Ex20.java:5
Class
Ex25
快速排序切换到插入排序 @author huang
code/chapter2_3_Quicksort/Ex25.java:14
Class
Ex3
code/chapter1_1_Programming_Model/Ex3.java:6
Class
Ex30
code/chapter1_1_Programming_Model/Ex30.java:5
Class
Ex31
code/chapter1_1_Programming_Model/Ex31.java:8
Class
Ex32
code/chapter1_1_Programming_Model/Ex32.java:8
Class
Ex6
code/chapter1_1_Programming_Model/Ex6.java:5
Class
Ex7a
code/chapter1_1_Programming_Model/Ex7a.java:5
Class
Ex7b
code/chapter1_1_Programming_Model/Ex7b.java:5
Class
Ex7c
code/chapter1_1_Programming_Model/Ex7c.java:5
Class
Ex8
code/chapter1_1_Programming_Model/Ex8.java:3
Class
Ex9
code/chapter1_1_Programming_Model/Ex9.java:5
Class
Flips
code/chapter1_2_Data_Abstraction/Flips.java:7
Class
FlipsMax
code/chapter1_2_Data_Abstraction/FlipsMax.java:7
Class
FrequencyCounter
符号表的用例 @author huang
code/chapter3_1_Symbol_Tables/FrequencyCounter.java:11
Class
Graph
code/chapter4_1_Undirected_Graphs/Graph.java:6
Class
Heap
The {@code Heap} class provides a static methods for heapsorting an array. <p> For additional documentation, see <a href="http://algs4.cs.princeton
code/algs4/Heap.java:36
Class
HeapIterator
code/algs4/IndexMinPQ.java:307
Class
HeapIterator
code/algs4/MinPQ.java:247
Class
HexDump
The {@code HexDump} class provides a client for displaying the contents of a binary file in hexadecimal. <p> For additional documentation, see <a
code/algs4/HexDump.java:45
Class
In
<i>Input</i>. This class provides methods for reading strings and numbers from standard input, file input, URLs, and sockets. <p> The Locale used i
code/algs4/In.java:56
Class
IndexMinPQ
The {@code IndexMinPQ} class represents an indexed priority queue of generic keys. It supports the usual <em>insert</em> and <em>delete-the-minimum</
code/algs4/IndexMinPQ.java:44
Class
Insertion
插入排序 @author huang
code/chapter2_1_Elementary_Sorts/Insertion.java:9
Class
Interval1D
The {@code Interval1D} class represents a one-dimensional interval. The interval is <em>closed</em>—it contains both endpoints. Intervals are immuta
code/algs4/Interval1D.java:29
Class
Interval2D
The {@code Interval2D} class represents a closed two-dimensional interval, which represents all points (x, y) with both {@code xmin <= x <= xmax} and
code/algs4/Interval2D.java:29
Class
Interval2DTest
code/chapter1_2_Data_Abstraction/Interval2DTest.java:9
Class
KMP
@author huang Knuth-Morris-Pratt 字符串查找算法
code/chapter5_3_Substring_Search/KMP.java:9
Class
KWIC
@author huang keyword-in-context 上下文的关键词的索引用例
code/chapter6_3_Suffix_Arrays/KWIC.java:12
Class
KosarajuSCC
code/chapter4_2_Directed_Graphs/KosarajuSCC.java:6
Class
KruskalMST
code/chapter4_3_Minimum_Spanning_Tree/KruskalMST.java:6
Class
LRS
@author huang 最长重复子字符串算法的用例
code/chapter6_3_Suffix_Arrays/LRS.java:10
Class
LazyPrimMST
code/chapter4_3_Minimum_Spanning_Tree/LazyPrimMST.java:11
Class
LengthComparator
code/algs4/Interval1D.java:207
Class
LinearProbingHashST
code/chapter3_4_Hash_Tables/LinearProbingHashST.java:5
Class
ListIterator
code/algs4/Bag.java:115
Class
ListIterator
code/algs4/Stack.java:149
Class
ListIterator
code/algs4/Queue.java:144
Class
MaxEndpointComparator
code/algs4/Interval1D.java:196
Class
MaxPQ
基于堆的优先队列 @author huang
code/chapter2_4_Priority_Queues/MaxPQ.java:8
Class
Merge
@author huang 自顶向下的归并排序
code/chapter2_2_Mergesort/Merge.java:9
Class
MergeBU
@author huang 自底向上的归并排序
code/chapter2_2_Mergesort/MergeBU.java:9
Class
MinEndpointComparator
code/algs4/Interval1D.java:185
Class
MinPQ
The {@code MinPQ} class represents a priority queue of generic keys. It supports the usual <em>insert</em> and <em>delete-the-minimum</em> operation
code/algs4/MinPQ.java:48
Class
Node
code/algs4/Bag.java:59
Class
Node
code/algs4/Stack.java:54
Class
Node
code/algs4/Queue.java:47
Class
Node
code/chapter3_1_Symbol_Tables/SequentialSearchST.java:5
Class
Node
code/chapter3_2_Binary_Search_Trees/BST.java:8
Class
Out
This class provides methods for writing strings and numbers to various output streams, including standard output, file, and sockets. <p> For additi
code/algs4/Out.java:33
Class
Particle
The {@code Particle} class represents a particle moving in the unit box, with a given position, velocity, radius, and mass. Methods are provided for
code/algs4/Particle.java:29
Class
Picture
This class provides methods for manipulating individual pixels of an image. The original image can be read from a {@code .jpg}, {@code .gif}, or {@c
code/algs4/Picture.java:63
Class
PictureDump
The {@code PictureDump} class provides a client for displaying the contents of a binary file as a black-and-white picture. <p> For additional docum
code/algs4/PictureDump.java:35
Class
Point
code/chapter1_1_Programming_Model/Ex31.java:10
Class
Point2D
The {@code Point} class is an immutable data type to encapsulate a two-dimensional point with real-value coordinates. <p> Note: in order to deal wi
code/algs4/Point2D.java:31
Class
PolarOrder
code/algs4/Point2D.java:247
Class
PrimMST
code/chapter4_3_Minimum_Spanning_Tree/PrimMST.java:8
next →
1–100 of 151, ranked by callers