搜索资源列表
opengl_3d_maze
- 此程序采用 opengl 结合图结构实现了3d迷宫的绘制，具有参考意义-procedure used opengl graph structure to achieve a maze of 3d rendering, with the reference value
MemoryMonitor
- MemoryMonitor demonstrates the use of the java.lang.management API in observing the memory usage of all memory pools consumed by the application. This simple demo program queries the memory usage of each memory pool and plots the memory u
hamilton9901
- 给定一个n个结点的连通图，用回溯法求出图中含有的所有哈密尔顿环。包含实验报告。 -given a n nodes in a graph, with retrospective method, the map contains all the Hamilton Central. The report contains experiments.
segment
- source code and ref paper of C++ implementation of the image segmentation algorithm described in the paper: \"Efficient Graph-Based Image Segmentation\"-source code and ref paper of C implementati on of the image segmentation algorithm describ ed in
FSofGragh
- 图论中关于简单无向图的深度，广度搜索，由图形界面简单方便的演示。-on graph theory to a simple map with the breadth, depth search by the graphical interface is simple and convenient to the demonstration.
vc++graph
- 在vc环境下实现柱状图形，vc++以曲线或柱状图的形式实时动态显示数据的控件。txt格式，源码只需简单调入调试即可-in vc environment under columnar graphics, vc column of a curve or in the form of real-time dynamic display of data control. Txt format, you can simply source debugger can be transferred
MaxST
- 图论：最大支撑树算法实现 GraphM.h GraphOpr.h MaxST.cpp MaxST.dsp MaxST.dsw MaxST.h MaxST.ncb MaxST.opt MaxST.plg MaxST.sln MaxST.vcproj sample.gph-graph theory : the largest Spanning Tree Algorithm GraphM.h GraphOpr.h MaxST.cpp MaxS T.dsp
mColor
- 图论：图的M着色问题 GraphM.h GraphOpr.h mColor.cpp mColor.dsp mColor.dsw mColor.h mColor.ncb mColor.opt mColor.plg test test.gph-graph theory : Figure M Coloring GraphM.h GraphOpr.h mColor.cpp mColo r.dsp mColor.dsw mColor.h mColor.ncb m
ShortPth
- 图论：最短路径算法实现 Graph.gph GraphBFS.h GraphM.h GraphOpr.h Queue.h sample.gph ShortPth.cpp ShortPth.dsp ShortPth.dsw ShortPth.ncb ShortPth.opt ShortPth.plg-graph theory : the shortest path algorithm Graph.gph GraphBFS.h GraphM.h Gra
Subtraction
- 以下是差影法的源程序。要注意的是，第一幅图的文件名为c:\\test.bmp，第二幅图的文件名是c:\\backgnd.bmp。它们有着相同的灰度值和调色板。执行时，这两个文件已经准备好。 我们针对的虽然是二值图，但为了处理的方便，用的是256级灰度图，不过只用到了0和255两种灰度级。-Subtraction law of the source. To be noted is, a document of the plan called c : \\ test.bmp, second gr
SimpleOCRsrc
- 车牌识别方面的论文.rar,HTML,图形/文字识别 Graph Recognize -Vehicle Identification papers. Rar, HTML, graphics / Graph Recognize Character Recognition
MySeg
- 最短路径法分词程序。将中文句子经过原子切分后生成一个有向无环图，然后使用Dijkstra算法求出由起点到终点的最短路径以实现中文分词。-shortest path method participle procedures. Chinese Sentence will be read after splitting atoms generated a directed acyclic graph. then use the Dijkstra algorithm derived from the s
datagainVC++
- 此文件囊括了多种数字图象处理的算法，其中包括边缘检测腐蚀膨胀图象压缩直方图修正平滑等多种图象处理技术-,Visual C++,图形图象 Graph program -this document to include a wide range of digital image processing algorithms, Edge Detection including corrosion expansion Image Compression histogram that smoothing v
DirectShowKAIFAZHINAN_Chapter05
- 《DirectShow开发指南》 范例源代码,Chapter05：第5章用到的代码，其中GraphBuilding为Filter Graph构建技术 的一些代码，SimplePlayer为一个简单的播放器例子。 -"DirectShow Development Guide" paradigm source code, Chapter05 : Chapter 5 to use the code, which GraphBuilding Graph Filter Cons
clc
- 用matalb程序来实现求一个连通图的最小生成树-matalb procedures used to achieve a graph for the minimum spanning tree
2006shortPath
- 一个关于图论的课程设计，求图中两个节点之间的最短路径的问题。包括详细的试验报告。-on a graph theory of curriculum design, seeking map between two nodes is the shortest path problem. Including the detailed test report.
GraphCC
- 有向图的强连通分量算法的java语言实现，-directed graph algorithms strongly connected component of java language.
match-v3.1.src.tar
- 计算机视觉中Stereo Vision的Graph Cut实现。一个比较Robust的算法。-computer vision Stereo Vision Graph Cut achieve. A more robust algorithm.
GONGCHEN
- C语言程序求最短路径问题,是无向图方面的. 数据结构中的图论-C language program for the shortest path problem, and there is no plan to the area. Data structure of the graph theory
youxiangwuhuantu
- 此程序为有向无环的代码，主要用于判断给定的图是否为有向无环图。-procedure for non-looped code mainly used to judge whether the plan for directed acyclic graph.