搜索资源列表
graphbfs
- 读图并输出图的邻接链表，输入两个结点，用广度优先寻找它们之间的最短路径并输出，并判断其是否是树，是否连通，是否有环，有要打印出来环．-interpret drawings and prints of adjacent chain, the importation of two nodes, with breadth between them priority for the shortest path and output, and a judgment whether it is trees,
matlabmatrix
- 1) Write a function reverse(A) which takes a matrix A of arbitrary dimensions as input and returns a matrix B consisting of the columns of A in reverse order. Thus for example, if A = 1 2 3 then B = 3 2 1 4 5 6 6 5 4 7 8 9 9 8 7 Writ
ctable
- Program prints out multiplication tables. 输出乘法表格的程序！
yuesefu
- 本程序采用循环单链表的算法来解决约瑟夫环问题：建立一个循环单链表，按顺序查找指定结点，找到后删除，最后打印删除的编号序列。- This procedure uses circulates Shan Lianbiao algorithm to solve the Joseph link problem: Establishes to circulate Shan Lianbiao, assigns the point according to the smooth search, after
timestamp
- prints the current YMDHMS date as a timestamp
ekranaBas
- This scr ipt prints contents of a mat. type data file to the Matlab command window
mcFlo
- mcFlo reads a wflograph from stdin, computes a min cost maximum flow using the method specified by the argument and then prints the wflograph with the computed flow.
conversion_gui
- function ret = Int2Hex(var) Prints integer array to hexadecimal string varType = class(var) cast signness away: if ( u ~= varType(1) ) varType = [ u varType] var = typecast(var,varType) end nBits = str2double(
Assymmetric-Cryptography-project
- This is the Assysmmetric Cryptography algorithm created using Java. This is to identfy Finger prints.One of the popular algorithm
C.
- 判断101-200之间有多少个素数，并输出所有素数。 1.程序分析：判断素数的方法：用一个数分别去除2到sqrt(这个数)，如果能被整除， 则表明此数不是素数，反之是素数。 -Between 101-200 to determine the number of primes, and prints out all prime numbers. 1 program analysis: methods to determine the prime numbers: a numb
hello-world
- Hello world application. This application automatically prints "Hello World"
DoRigidReg3D
- Hello world application. This application automatically prints "Hello World"
Josephus--problem
- 约瑟夫斯（Josephus）问题的一种描述是：编号为1，2，…，n的n个人按顺时针方向围坐一圈，每人持有一个密码（正整数）。一开始任选一个正整数作为报数上限值m，从第一个人开始按顺时针方向自1开始报数，报到m时停止报数。报m的人出列，将他的密码作为新的m值，从他在顺时针方向下一个人开始重新从1报数，如此下去，直至所有的人全部出列为止。试设计一个程序，按出列顺序印出各人编号。-Josephus (Josephus) a descr iption of the problem are: number
C8-C9-C10-C11-C12
- 判断101-200之间有多少个素数，并输出所有素数。 1.程序分析：判断素数的方法：用一个数分别去除2到sqrt(这个数)，如果能被整除，则表明此数不是素数，反之是素数。 -Between 101-200 to determine the number of prime numbers, and prints out all prime numbers. 1 program analysis: the method to determine the prime numbers: a
third2
- 2．编写程序实现表达式求值，即验证某算术表达式的正确性，若正确，则计算该算术表达式的值。 主要功能描述如下： 1、从键盘上输入表达式。 2、分析该表达式是否合法： （1）是数字，则判断该数字的合法性。若合法，则压入数据到堆栈中。 （2）是规定的运算符，则根据规则进行处理。在处理过程中，将计算该表达式的值。 （3）若是其它字符，则返回错误信息。 3、若上述处理过程中没有发现错误，则认为该表达式合法，并打印处理结果。 -2. Write a program to
yusefusi
- 约瑟夫斯（Josephus）问题的一种描述是：编号为1，2，…，n的n个人按顺时针方向围坐一圈，每人持有一个密码（正整数）。一开始任选一个 正整数作为报数上限值m，从第一个人开始按顺时针方向自1开始报数，报到m时停止报数。报m的人出列，将他的密码作为新的m值，从他在顺时针方向下一个人 开始重新从1报数，如此下去，直至所有的人全部出列为止。试设计一个程序，按出列顺序印出各人编号。-Josephus (Josephus) a descr iption of the problem is: numbe
tmrTestK
- Test Timer fucntion in matlab prints HellA, HellAA, HellAAA, HellAAAA,HellAAAAA after timerperiod 1,2,3,4,5 respectively and then stops Written by Khalid Mahmood-Test Timer fucntion in matlab prints HellA, HellAA, HellAAA, HellAAAA,HellAAAAA
PROGRAM-1
- this program written is fortran is for evaluating the charge build up in a capacitor. It prints the output showing the value of charge as time passes.
hafuman
- 该程序为实现哈夫曼的一些应用而设计的，其中用到了MFC直观的打印了树的形状，并且在界面上做了些美化工作，用到了屏幕雨，通过光标移动可控制程序的菜单，等等。-The program for the Huffman some applications and design, which uses the MFC prints intuitive tree shape, and the interface to do some landscaping work, use a rain screen,
2968_EX08
- 1. Write a program that reads ten numbers supplied by the user into a single subscr ipted array, and then prints out the average of them. 2. Write a program that reads ten numbers supplied by the user into a 2 by 5 array, and then prints out the max