-
ahuangCD
这个是数据结构课程设计中阿黄的CD的程序代码的工程文件包(This is a data structure curriculum design A yellow CD program code works package)
- 2013-12-21 18:53:00下载
- 积分:1
-
The-sum-of-Multinomial
数据结构中的一元多项式相加,多于考研算法实现很重要。后续部分将在后期上传!(The sum of Multinomial)
- 2011-05-09 15:47:30下载
- 积分:1
-
Birch
这是birch C语言的源代码。里面有详细的代码注释方便学习birch算法(birch c)
- 2012-05-08 09:00:44下载
- 积分:1
-
ds3
单向链表的创建与操作
设单向链表中节点的数据域的数据类型为整型,编写函数实现以下操作:
(1)实现单向链表的创建(包括初始化)与输出操作,节点的个数及节点的数据由用户输入。
(源代码:ds3-1.c)
(2)查找给定的单链表中的第i个节点,并将其地址返回。若不存在第i个节点,则返回空地址。
(源代码:ds3-2.c)
(3)查找给定的单链表中值为n的节点,并将其地址返回。若不存在值为n的节点,则返回空地址。同时,还应通过参数传回该节点的序号。
(源代码:ds3-3.c)
(4)删除给定的单链表中的第i个节点,成功返回1,失败返回0。
(源代码:ds3-4.c)
(5)删除给定的单链表中值为n的节点,成功返回1,失败返回0。
(源代码:ds3-5.c)
(6)在给定的单链表的第i位上插入值为n的节点。
(源代码:ds3-6.c)
(7)在给定单链表的值为m的节点的前面插入一个值为n的节点。
(源代码:ds3-7.c)
(Creation and operation of a one-way linked list
Set up a one-way linked list data type node integer data fields , write a function to achieve the following:
( 1 ) achieve the creation of a one-way linked list ( including initialization ) and output operation , the number of nodes and node data entered by the user .
( Source : ds3-1.c)
( 2 ) Find a single list given in the i-th node and returns its address . Without the presence of the i-th node , returns an empty address.
( Source : ds3-2.c)
( 3 ) Find a given node in a given value of n single list , and return address . Without the presence of the value of n nodes , returns an empty address. Meanwhile, the number should be returned by the parameters of the node .
( Source : ds3-3.c)
( 4 ) Delete the given singly linked list in the i-th node , the successful return 1, else return 0 .
( Source : ds3-4.c)
( 5 ) to delete a single node in the list is given n , the successful return 1, else return 0 .
( Source : ds3-5.c)
( 6 ) )
- 2014-05-11 19:19:41下载
- 积分:1
-
BinarySearchTree
在Visual Studio 2008运行成功 数据结构 二叉查找树的类(In Visual Studio 2008 running a successful binary search tree data structure classes)
- 2013-07-23 22:04:29下载
- 积分:1
-
lianbiaoqiujiaoji
该程序是数据结构中以链表存储形式来求两个集合的交集,用C++语言描述的(The program is the form of a linked list stored in the data structures to seek the intersection of two sets, C++ language to describe)
- 2012-04-24 22:35:37下载
- 积分:1
-
lujing
图的邻接表生成,深度遍历及任意两点间的路径(The adjacency table to generate deep traversal path between any two points)
- 2012-05-22 18:18:29下载
- 积分:1
-
migong
迷宫算法,1代表可以通过,0代表墙壁,自动找寻路线(Maze algorithm, 1 can pass 0 for the walls, automatically find routes)
- 2011-06-11 17:13:39下载
- 积分:1
-
expression
利用栈完成算术表达式求值:从键盘或文件中输入算术表达式,计算其结果并显示。要求处理过程为:(1)转换为后缀表达式并输出;(2)对后缀表达式求值并输出。
输入的表达式中可以有整数、实数、括号,运算符包括+、-、*、/、#(代表单目负)。可以多次输入不同的表达式进行计算,直到用户选择“退出”。栈的基本操作可以自己实现,也可以使用系统提供的STL实现。
(Done using an arithmetic expression evaluation stack: file input from the keyboard or an arithmetic expression, calculate and display the results. Requirements process: (1) to postfix expression and output (2) evaluation of the postfix expression and output. Enter the expression can be integers, real numbers, parentheses, operators including+,-,*,/,#( representatives unary minus). You can enter several different expressions are evaluated until the user selects " Exit." Stack can implement the basic operations, you can also use the system implementation of the STL.)
- 2011-10-30 14:14:01下载
- 积分:1
-
1_1
最小生成树算法 克鲁斯法尔算法 球最佳路径(kulru method class maiun void cx )
- 2009-09-13 22:45:01下载
- 积分:1