canny算子 图像边缘检测

用C++实现坐标的绘制和坐标的伸缩变换其他的一些操作-coordinate Drawing and transformation and others function by c++

搜索并清除临时垃圾文件的工具-search and remove temporary refuse document tools

这是代码中使用 matlab 将匹配指纹。P 码受保护的代码示例。您可以将转换为 c 代码的代码 matlab。

一个用c语言实现的链表,链表是实现了一个同学录-a language with the List, the List is a website

另一种delphi学习lua使用的例子.对提高lua有所帮助-Another example of the use delphi to learn lua. To help improve the lua

通过广度优先算法，不断加入一结点或边，得到指定结点或边数的网络-Through breadth-first algorithm, and continuously adding a node or edge, has been designated node or edge of the network

Assume that Edison has found himself in a square-shaped maze of NxN square cells which is surrounded by walls from the outside. In the maze, some of the cells are also walls. Edison can only move between two empty cells in four directions, north, south, west and east. In order to get out of the maze, he drafts a plan. He uses his left hand to lean on the wall and goes by following the wall. Here is the question, is Edison able to get out of the maze in at most 10,000 steps? If he can make it, output the path. By getting out of the maze, he only needs to be in the exit cell. If the starting cell is the same as the exit, Edison won"t need to move and can directly get out of the maze. Input The first line of the input gives the number of test cases, T. T test cases follow. Each test case starts with an integer N. N is the size of the maze. Th

严蔚敏数据结构最后一个实验. 对各种排序算法进行比较-Yan Wei Min data structure a final experiment. Sorting Algorithm for various comparisons

英文字符识别程序，可以快速识别英文字符-English characters identification procedures can quickly identify English characters

这是一个求最短路和最小生成树的C++的原代码,经过调试可以在机子上使用.-This is the most short-circuit for a minimum spanning tree and the original C code, after testing the use of loom.