小目标----- 2020-01-27 12:04:41
Description: The experiments involved in data structure learning are suitable for reference in the learning process.
Plat: C/C++ | Size: 983KB | Downloads: 0
wdf12138 2020-01-22 21:41:18
Description: Using C language to realize Huffman tree and print it
Plat: C/C++ | Size: 284KB | Downloads: 0
lmt19990807 2020-01-19 19:47:06
Description: Establish the storage structure of the tree's child and brother list, and find the depth of the tree. Requirement: 1) Input each edge in the tree from top to bottom (for example, a, AB, AC, BD, b). Do not convert it to binary tree input. 2) According to the traversal order from root to leaf node in the tree (input from left to right in each layer), input the node sequence and the degree of each node, and construct the child brother list.
Plat: C/C++ | Size: 1500KB | Downloads: 0
lmt19990807 2020-01-19 19:45:43
Description: The binary list storage structure of binary tree is established according to the extended sequence of traversal in the first order, the recursive algorithm of traversal in the first order, the middle order and the later order of binary tree is realized, the non recursive algorithm of traversal in the middle order of binary tree is realized, the non recursive algorithm of traversal in the hierarchy of binary tree is realized, the number of nodes of binary tree is calculated, and the depth of binary tree is calculated.
Plat: C/C++ | Size: 2120KB | Downloads: 0
lmt19990807 2020-01-19 19:44:06
Description: The hash table is constructed by using the method of removing and reserving remainder. The loading factor is required to be no more than 0.7. The conflict is solved by linear detection and hashing, and the hash table is output. Any key words are input to determine whether they are in the hash table. If there is a successful search and the number of searches are displayed. If not, the key sequence in the hash table is inserted and displayed.
Plat: C/C++ | Size: 2138KB | Downloads: 0
lmt19990807 2020-01-19 19:43:06
Description: 1. Construct a binary sort tree and output it through middle order traversal; 2. Find a keyword in the binary sort tree. If it exists, the search is successful. If it does not exist, insert it into the binary sort tree, and then iterate the output in the middle order.
Plat: C/C++ | Size: 2151KB | Downloads: 0
lmt19990807 2020-01-19 19:37:14
Description: Bubble sorting Fast sorting Simple selection and sorting Merging and sorting Heap sorting
Plat: C/C++ | Size: 1231KB | Downloads: 0
bababhayanak 2020-01-18 20:33:30
Description: machine learning in c++
Plat: C/C++ | Size: 369KB | Downloads: 0
okcz 2020-01-17 16:43:30
Description: Sort Algorithm collection.
Plat: Java | Size: 22KB | Downloads: 0
Beeeee 2020-01-15 22:31:30
Description: 951 data structure and algorithm analysis courseware of Xi'an University of Electronic Science and technology
Plat: C/C++ | Size: 21784KB | Downloads: 0
2020-01-14 19:42:02
Description: LinkNode,print,reverse,linknode
Plat: C/C++ | Size: 6099KB | Downloads: 0
liqiuhua888 2020-01-14 16:56:46
Description: Mesh simplification and rebuild methods
Plat: C/C++ | Size: 6964KB | Downloads: 0
wanglc0914 2020-01-06 18:41:16
Description: POJ topics and algorithms, including dynamic programming, deep search and wide search algorithms. Including relevant notes.
Plat: C/C++ | Size: 7KB | Downloads: 0
mmachine 2020-01-06 14:25:13
Description: Data structure review materials can expire the final exam, although there is no answer
Plat: C/C++ | Size: 2095KB | Downloads: 0
小nc 2020-01-05 16:54:40
Description: This is the sequential / chain implementation of the table data structure, which implements the insertion of the table through dynamic storage
Plat: Python | Size: 9KB | Downloads: 0
mitolia 2020-01-05 16:15:32
Description: #include<iostream> #include<cstdio> using namespace std; bool f[105][105],a[105]; int m,n,ans; void ooo(int s) { a[s]=1; for(int i=1;i<=n;i++) { if(!a[i]&&f[s][i]) { m++; a[i]=1; ooo(i); } } } int main() { int x,y; scanf("%d%d%d",&n,&x,&y); while(x&&y) { f[x][y]=1; f[y][x]=1; scanf("%d%d",&x,&y); } for(int i=1;i<=n;i++) { m=0; if(!a[i]) { ooo(i); ans=max(ans,m); } } printf("%d",ans+1); return 0; }
Plat: C/C++ | Size: 488KB | Downloads: 0
lseap 2020-01-04 19:44:42
Description: Data structure experiment - (undirected graph) interface implementation of undirected graph based on adjacency array (including source code + experiment report + executable program)
Plat: C/C++ | Size: 724KB | Downloads: 0
啊楠楠 2020-01-02 14:30:19
Description: The implementation of the classic palindrome sequence problem in algorithm problems is simple and clear
Plat: C/C++ | Size: 1KB | Downloads: 0
abcoold 2019-12-31 00:58:00
Description: PyTorch Basic applications and examples
Plat: Python | Size: 9KB | Downloads: 0
小菜鸟小小 2019-12-30 22:14:43
Description: Four operations in C language
Plat: C/C++ | Size: 38KB | Downloads: 0
lpsaynoword 2019-12-30 20:08:35
Description: Linked list for polynomial addition and multiplication
Plat: C/C++ | Size: 1KB | Downloads: 0
鱼子桐狍 2019-12-30 16:35:41
Description: (1) the working time of each person shall not exceed 720 minutes, and each branch shall be arranged successively from the first branch to the last branch. Each Courier serves only one outlet. (2) when arranging the Courier, output the pick-up status first, and then the delivery status.
Plat: matlab | Size: 1KB | Downloads: 0
鱼子桐狍 2019-12-30 16:34:13
Description: The difference between pick-up time and delivery time is 90 minutes. Therefore, we developed the following distribution scheme: firstly, merchants were clustered, and 598 merchants were divided into 74 categories according to the index of the nearest network. For each location, orders with similar pickup times are placed together and then delivered in turn
Plat: matlab | Size: 1KB | Downloads: 0
hfwang941031 2019-12-30 11:10:33
Description: Three realizations of knapsack problem, 01 knapsack, multiple knapsack, complete knapsack
Plat: Java | Size: 2KB | Downloads: 0
wenjingyuer 2019-12-29 23:46:35
Description: Data structure Each school has 1,800 exam questions, including answers.
Plat: C/C++ | Size: 838KB | Downloads: 0
Cathrial 2019-12-28 17:26:52
Description: In the eighth chapter of data structure, some computer topics are included: 1. Verification of searching ordered tables. 2. Verification of binary sorting tree.
Plat: C/C++ | Size: 13018KB | Downloads: 0
houtian81 2019-12-27 14:57:36
Description: Mainly using C language to realize the curriculum design of data structure, the code uses linked list structure to store relevant data!
Plat: C/C++ | Size: 2KB | Downloads: 0
打赏66 2019-12-24 22:29:24
Description: Realize different functions of single chip microcomputer, such as different types of single chip microcomputer, mainly C51
Plat: Java | Size: 440KB | Downloads: 0
Luckdog691 2019-12-24 19:49:16
Description: University data structure course: reference ppt of Search chapter
Plat: C/C++ | Size: 358KB | Downloads: 0
Luckdog691 2019-12-24 19:48:07
Description: ppt handout for data structure course sequencing
Plat: C/C++ | Size: 361KB | Downloads: 0
Tags: