搜索资源列表
color-map
- 地图上色 #include <stdio.h> #include <stdlib.h> #define MAX 100 typedef struct{int code int color }Area /*区域结构*/ typedef struct{Area a[MAX] int vn int en }Map /*地图结构*/ void CreateM(Map m)/*生成地图,并统
josepharray
- 约瑟夫问题,用链式结构实现,有N个数,从S开始报数M,列出前后出序序列-Joseph problems with the chain structure to achieve, there are N number, starting from the S reported that the number M, before and after the order listed in the sequence
JosephLink
- 约瑟夫问题,链表实现。有N个数,从S开始报数m,打印出序序列-Joseph problems linked list. There are N number, starting from the S reported that the number m, print out the order sequence
PythonScripts
- Python scr ipts for Blind Stegnalaysis with the help of S.P.A.M.( Subtractive pixel adjacency Matrix )-Python scr ipts for Blind Stegnalaysis with the help of S.P.A.M.( Subtractive pixel adjacency Matrix )
Mazing-Problem
- 迷宫问题 以一个m*n的长方阵表示迷宫,0和1分别表示迷宫中的通路和障碍。设计一个程序,对任意设定的迷宫,求出一条从入口到出口的通路,或得出没有通路的结论。 基本要求: (1)首先实现一个以链表作存储结构的栈类型,然后编写一个求解迷宫的非递归程序。求得的通路以三元组(i,j,d)的形式输出,其中(i,j)指示迷宫中的一个坐标,d表示走到下一坐标的方向。 (2)测试几组数据,数据的规模由小变大,即网格越来越小,障碍越来越复杂。 拓展要求: 实现该问题的可视化界面,用鼠标点
arabic-java
- SCJP Sun Certified Programmer for Java 6 Exam 310-065[1]SCJP Sun Certified Progr mer for Java 6 Exam 310-065 SCJP Sun Cert ied Prog m er for Java 6 E am 310- 65[1]SCJP S n Cert fied Pro mmer for Ja-SCJP Sun Certified Programmer for Java 6 Exam 310-06
API
- MATLAB的M文件编译成dll文件供VC6调用-VC6 Debug the dll folder from the MATLAB S m-file
Dijkstra
- 图与网络论中求最短路径的Dijkstra算法 M-函数 格式 [S,D]=minroute(i,m,W) i为最短路径的起始点,m为图顶点数,W为图的带权邻接矩阵, 不构成边的两顶点之间的权用inf表示。显示结果为:S的每 一列从上到下记录了从始点到终点的最短路径所经顶点的序号; D是一行向量,记录了S中所示路径的大小 -Graph and network theory Dijkstra' s shortest path algorithm M-functio
(eBook)---C-Game-Programming-for-Dummies-2-(1).ra
- Just for being nice, I m presenting you with some Supplemental Lessons designed to help further your conquest of the C language. Some of these were promised in the book, others are done for the heck of it, still others are prompted as solutio
joseph
- 约瑟夫(Joseph)问题的一种描述是:编号为1,2,..., n 的n 个人按顺 时针方向围坐一圈, 每人持有一个密码(正整数)。一开始选任一个正整数作为报数上限值m, 从第一个人开始按顺时针方向自1开始顺序报数,报到m时停止报数。报m的人出列,将它的密码作为新的m值,再从下个人开始新一轮报数,如此反复,直到剩下最后一人则为获胜者。试设计一个程序求出出列顺序。-Joseph (Joseph) a descr iption of the problem is: numbered 1,2 ,.
QualityGuidedUnwrap2D_r1
- 相位解缠是InSAR数据处理中的关键处理环节之一,对于DEM质量影响较大,传统的枝切线法容易受相干性差区域的影响,而采用质量图导引则可有效解决之。-Updated the code to run faster by improving the logic and by implementing Itoh s in-line method to remove 2*pi jumps, rather than calling unwrap. Allowed edge pixels to also
InvCWT
- This collection of files is an extension of the wavelet software package originally written by Torrence and Compo (http://paos.colorado.edu/research/wavelets/software.html) The main functions are: 1. contwt.m: (continuous wavelet transform)
Bot_Preven1588955172003
- An interesting and simple program to demonstrated how bot prevention pictures are made (like the vote on this site -) ). Also included is a new feature that would further confuse any OCR program. I have included extensive comments to try and make it
shiyan1
- 曹梦龙 仿真大实验 欧拉 隐氏欧拉 改进欧拉的matlab m程序 包括命令 以及生成的图形-Euler implicit Euler Improved Euler s program, including command of matlab m-generated graphics and
matlab-exercise
- This file include many matlab excercise, you can download and using file .m to examine your matlab s skill. Thanks for see!
Skin
- BRC MATLAB code for BRC.fig BRC, by itself, creates a new BRC or raises the existing singleton*. H = BRC returns the handle to a new BRC or the handle to the existing singleton CALLBACK ,hObject,eventData,handles,...) calls the local function n
stuscores
- 定义二维数组存储m名学生n门功课的成绩,m和n键盘输入 * 并计算每个同学的平均成绩。 * 要求捕获以下几种异常: 类型不匹配异常,如输入的是字符串等 输入的数值范围不合理,如>100,或<0 求平均成绩时,要考虑被0除的异常。 -Defined two-dimensional array stored m n subjects of student achievement, m and n keyboard input* and calculate ea
cHAMP-potentiel
- Dans la partie expérimentale, nous allons considérer un cas simple où l’espace de configuration est limité à 2 dimensions avec des obstacles ponctuels (réduits à des points). On va considérer un espace de configuration de taille 100x100, où l’on
nls4
- 这个程序只合适计算k=1 (也就是Lcd=1),对于其他k值,一些参数要做适当变化。这也是soliton format 不宜用于非线性耦合开关的一个原因。它使问题复杂化。这个程序是计算孤子格式化下的非线性薛定格方程组,程序中的方程与我们之前的博文提供的程序的方程不同。我们当初做这个仿真的目的,一方面要重复 S. Trillo, S. Wabnitz, E. M. Wright and G. I. Stegman, 在他们论文“Soliton switching in fiber nonlinea
Blendeqn
- 一个简单演示OPENGL混合模式的程序,按A是GL_FUNC_ADD,S是GL_FUNC_SUBTRACT,R是GL_FUNC_REVERSE_SUBTRACT,M是GL_MIN,X是GL_MAX-A simple demonstration OPENGL mixed-mode, press the A is GL_FUNC_ADD, S is GL_FUNC_SUBTRACT, R is GL_FUNC_REVERSE_SUBTRACT, M is GL_MIN, X is GL_MAX