CodeBus
www.codebus.net
Search
Sign in
Sign up
Hot Search :
Source
embeded
web
remote control
p2p
game
More...
Location :
Home
SourceCode
Mathimatics-Numerical algorithms
Data structs
Main Category
SourceCode
Web Code
Develop Tools
Document
Other resource
Sub Category
Compress-Decompress algrithms
STL
Data structs
Algorithm
AI-NN-PR
matlab
Bio-Recognize
Crypt_Decrypt algrithms
mathematica
Maple
DataMining
Big Data
comsol
physical calculation
chemical calculation
simulation modeling
Search in result
Search
Data structs list
Sort by :
«
1
2
...
.43
.44
.45
.46
.47
1748
.49
.50
.51
.52
.53
...
2656
»
datastructure
Downloaded:0
When studying the data structure related to practice writing their own code and curriculum design, including the queue, the queue list, etc. The curriculum includes the source code and documentation
Update
: 2025-03-17
Size
: 809kb
Publisher
:
静
Calculate-Pi
Downloaded:0
Efficient numerical algorithm, calculation of pi using ordinary precision. Does not require the support of high-precision
Update
: 2025-03-17
Size
: 45kb
Publisher
:
BlueStar
DIJKSTRA
Downloaded:0
Suppose you want to find the shortest path between two intersections on a map, a starting point and a destination. To accomplish this, you could highlight the streets (tracing the streets with a marker) in a certain orde
Update
: 2025-03-17
Size
: 1kb
Publisher
:
synthia
KRUSKAL
Downloaded:0
* create a forest F (a set of trees), where each vertex in the graph is a separate tree * create a set S containing all the edges in the graph * while S is nonempty and F is not yet spanning o remove an edge with minimu
Update
: 2025-03-17
Size
: 1kb
Publisher
:
synthia
my_BFS
Downloaded:0
1. Enqueue the root node. 2. Dequeue a node and examine it. * If the element sought is found in this node, quit the search and return a result. * Otherwise enqueue any successors (the direct child nodes) that have not y
Update
: 2025-03-17
Size
: 1kb
Publisher
:
synthia
MY_DFS
Downloaded:0
DFS is an uninformed search that progresses by expanding the first child node of the search tree that appears and thus going deeper and deeper until a goal node is found, or until it hits a node that has no children. The
Update
: 2025-03-17
Size
: 1kb
Publisher
:
synthia
MY_QUICK
Downloaded:0
1. Pick an element, called a pivot, from the list. 2. Reorder the list so that all elements with values less than the pivot come before the pivot, while all elements with values greater than the pivot come after it (equ
Update
: 2025-03-17
Size
: 1kb
Publisher
:
synthia
0-1hui
Downloaded:0
0-1 背包问题
Update
: 2025-03-17
Size
: 7kb
Publisher
:
lll
AVL_BST
Downloaded:0
Binary search tree and AVL tree
Update
: 2025-03-17
Size
: 16kb
Publisher
:
lingyi
FFT
Downloaded:0
Digital signal in the Fourier transform procedures for the realization of the basic algorithm
Update
: 2025-03-17
Size
: 1kb
Publisher
:
帅路
ch1
Downloaded:0
Yan Wei-Min
the first chapter program source code, using C to achieve.
Update
: 2025-03-17
Size
: 3kb
Publisher
:
cqs
ch2
Downloaded:0
Yan Wei-Min
the sencond chapter program source code, using C to achieve.
Update
: 2025-03-17
Size
: 38kb
Publisher
:
cqs
«
1
2
...
.43
.44
.45
.46
.47
1748
.49
.50
.51
.52
.53
...
2656
»
CodeBus
is one of the largest source code repositories on the Internet!
Contact us :
1999-2046
CodeBus
All Rights Reserved.