稀疏矩阵运算，c语言实现。

#包括；

Cuneyt Mertayak的Adaboost-matlab程序6个文件汇总+注释，能够在MATLAB运行成功实现Adaboost算法！

自己用C++做的简单的迷宫，特点是可以自定义迷宫的属性-own use C to do simple maze, which is characterized can define the attributes of the maze

这是由作者 ofOh 演示实现等。al.，基于离散余弦变换，可选性 2012.Thanks 的实时运动检测。

二维数组的操作运算,求出二维数组的非对角线元素之和-The operation of two-dimensional array of computing, to derive two-dimensional array of non-diagonal elements and

素数环： 把从1到10这10个数摆成一个环，要求相邻的两个数的和是一个素数。 〖问题分析〗 这是一道回溯的题目。从1开始，每个空位有9种可能，每种可能加入约束条件即可 1.与前面所有的数不重复 2.与前一个数和为素数（最后一个和第一个也要满足）。 〖算法流程〗 1、数据初始化； 2、递归填数： 判断第J种可能是否合法；  A、如果合法：填数；判断是否到达目标（10个已填完）： 是，打印结果；不是，递归填下一个；  B、如果不合法：选择下一种可能；-Prime Central: 1-10 from 10 the number of put this into a ring, asked the two adjacent numbers and is a prime number. 〗 〖Analysis is a retrospective this topic. From 1 year, 9 out of every space possible, each may be bound by the conditions of accession to 1. And in front of all the number of non-repetition, 2. With a few and for a prime number (the last and the first to meet). 1〗 〖algorithm processes the data to initialize 2, fill in the number of recursion: first to determine the legality of J possible A, if the legitimate: the number of Reclamation to determine whether the target (10 have been completed): Yes, print the results of not, fill in the next recursive B, if not legitimate: a possible alternative

求解有向图的路径-Solving the path digraph

/* ;======================Ó²¼þ½á¹¹====================== ; ;                          __________ ;           ;      */ //8·¿ØÖƳÌÐò // #include __CONFIG( WDTDIS  & PWRTEN &INTOSCIO & MCLRDIS & BOREN & CPD &  CPROTECT);

稀疏距阵的链表实现希望有所帮助-sparse matrix objectlist hope to achieve some help

本文件为线性方程组求解的指导,并赋有代码-This document is for the linear equations to solve the guidance of, and are endowed with the code