Description: about data structure

Plat: C-C++ | Size: 45833KB | Downloads: 0

Description: The breadth first traversal (also called width priority traversal) is similar to the hierarchical traversal of a tree. The basic idea is to first access the specified starting point VV, and then select all the vertex W1 adjacent to the VV, W2, wtw1, W2, WT, and then access to W1, W2, W2, all the vertices adjacent to WT (except the vertices that have been accessed), From these visited vertices, we will access all the vertices that are adjacent to them (except the vertices that have been accessed). And so on, until all vertices have been visited.

Plat: C-C++ | Size: 26KB | Downloads: 0

Description: Neural network is the most widely used in life. There are many kinds of neural networks. RBF is one of them.

Plat: matlab | Size: 176KB | Downloads: 0

Description: (1) please program to screen out 12 independent solutions from all 92 feasible solutions of the n- queens problem, and the rest of the solutions can be obtained by these independent solutions using symmetry or rotation.
(2) if the queen n- problem requires that the algorithm be terminated after the first feasible solution is obtained, please program it.
Hint: whether the first feasible solution can be obtained by using the flag logo. According to the value of flag, it is decided whether to continue to call the layer or directly return to the upper calling point.

Plat: C-C++ | Size: 231KB | Downloads: 0

Description: Classroom operations of data structure classes, including table number, graph, query and sort.

Plat: C-C++ | Size: 2180KB | Downloads: 0

Description: Based on data structure, functions such as addition, subtraction, multiplication and division of univariate polynomials are realized in c++ language.

Plat: C-C++ | Size: 3KB | Downloads: 0

Description: Tree traversal, non recursive traversal and recursive traversal of two tree.

Plat: C-C++ | Size: 4685KB | Downloads: 0

Description: Student achievement management system records and records the performance of students in the class.
(1) using a two-way chain linear table. Each node stores information including name and result. Sorting requires that students who have failed grades should be kept in a single linked list according to their scores.
(2) initial input: read the students' information from the file and establish the initial list.
(3) dynamically adjusting the order of linked list, failing to pass the student's node to another list.
(4) a student's node can be transferred to the normal list after examination.
(5) a variety of common operations can be performed, such as displaying all student achievements, inserting a student node, deleting a student node, and querying student achievement.

Plat: C-C++ | Size: 18KB | Downloads: 0

Description: implementation of linked list, stack and queue

Plat: C-C++ | Size: 12KB | Downloads: 0

Description: When k>0, the chessboard of 2^k * 2^k can be divided into 4 sub chessboards of 2^ (k-1) * 2^ (k-1), as shown in Figure 4.11 (a). After this division, since the original chessboard has only one special square, only one of the 4 chessboards contains the special square, and the rest of the 3 chessboards have no special squares. In order to convert the 3 sub chessboards without special squares to a special chessboard to be solved by recursion, a L type bone plate can be used to cover the 3 smaller chessboards.

Plat: C-C++ | Size: 14KB | Downloads: 0

Description: the way to figure out the shortest path

Plat: Visual C++ | Size: 2KB | Downloads: 0

Description: easy QuickSort two types and anthor program in text

Plat: matlab | Size: 1KB | Downloads: 0

Description: Joseph ring (Joseph problem) is an application of Mathematics: known n individuals (numbered 1, 2, 3... N respectively) are sitting around a round table. The person numbered K began to count, and the man counted to m was listed; his next person began to report from 1, and the man numbered to the m was listed again; the rule repeated until all the people around the round table were listed. Usually when we solve this kind of problem, we turn the number from 0~n-1 to the last result +1, which is the solution of the original problem.

Plat: C-C++ | Size: 129KB | Downloads: 0

Description: The establishment and search of the stack, use, search. The creation of data structure stack

Plat: C-C++ | Size: 1KB | Downloads: 0

Description: The first order traversal of binary tree is realized, and the function of the sequential traversal is verified to be correct and can be compiled and run.

Plat: C-C++ | Size: 1KB | Downloads: 0

Description: a nearest datastructure

Plat: C-C++ | Size: 10941KB | Downloads: 0

Description: The branch and bound method of traveling salesman problem is applied by priority queue.

Plat: C-C++ | Size: 2KB | Downloads: 0

Description: Data structure C language version, learning data structure of students can see, improve programming skills.

Plat: C-C++ | Size: 7661KB | Downloads: 0

Description: Data structure (C language version) Joseph ring, the first program written in data structure.

Plat: C-C++ | Size: 1KB | Downloads: 0

Description: Delaunay triangulation is the most widely used triangulation in practice, and it is a special triangulation. The algorithm of Delaunay triangulation generated by point by point insertion is mainly based on Bowyer-Watson algorithm. The main steps of Bowyer-Watson algorithm are as follows:
1, construct a super triangle, including all scatter points, and put them into triangular lists.
2. Insert the scattered point of the point set in turn. In the triangle chain, find out the triangle which contains the insertion point (called the influence triangle of the point), deletes the common edge that affects the triangle, connects the insertion point to all the vertices of the triangle, and completes the insertion of a point in the Delaunay triangle chain table. Enter.
3, according to the optimization criterion, the newly formed triangle is optimized. The triangle formed is placed in the Delaunay triangular list.
4, loop the above second steps until all the scatter points are inserted.

Plat: C# | Size: 81KB | Downloads: 0

Description: The algorithm program is implemented in the specific way of Strassen problem, and the effect is very good.

Plat: C-C++ | Size: 87KB | Downloads: 0

Description: python solve Hanoi-tower-question

Plat: Python | Size: 3819KB | Downloads: 0

Description: A simple implementation of two forked trees in Python language

Plat: Python | Size: 3KB | Downloads: 0

Description: More efficient search and a deeper understanding of the application of learning queue in the two fork tree and the application of two fork tree queue in engineering.

Plat: C-C++ | Size: 3KB | Downloads: 0

Description: [basic content]
(1) an arithmetic expression that is input in inverse Poland (assuming that every operand is represented by a single character letter, that is, the number of operands.
An identifier is an alphabet;
(2) initialization of the expression tree;
(3) to generate the expression tree;
(4) output the traversal results of the expression tree.
(5) print the expression tree;
(6) delete the expression tree;
(7) design the corresponding "menu" and select the keyboard input to complete the test.

Plat: C-C++ | Size: 926KB | Downloads: 0

Description: using c programming 8 queenpos problem

Plat: C-C++ | Size: 13KB | Downloads: 0

Description: 0-1bag problem using c++

Plat: C-C++ | Size: 297KB | Downloads: 0

Description: Based on Embedded Linux platform, using C language, use linked list to realize picture display, Guangdong embedded ger board.

Plat: C-C++ | Size: 8KB | Downloads: 0

Description: implement a queue using two stacks

Plat: C-C++ | Size: 6926KB | Downloads: 0