搜索资源列表
BottomUpParser
- （1）可选择不同的规则集（用普通文本文件存贮规则）。 （2）利用VC TreeCtrl控件显示分析得到的句法结构树。 （3）中间分析过程产生的所有边都输出到结果文件，便于跟踪分析的细节。 （4）分析过程中，检索规则集中的规则，查到一条满足条件的规则就停止，因而产生的不是全部分析结果，并且，规则的顺序也会对分析结果有影响（可比较两个规则文件，其中规则内容一样，但有两条规则的顺序不同，在分析 “学习/verb 文件/noun” 这样的例子时结果就不同： -(1)
算法第一次实验
- 着色问题，输入一个图和颜色的种数，要求有邻边的两个顶点不能着同一种颜色，找出所有的着色方案-coloring, the importation of a color map and the number of categories, and a two adjacent edges of the peak is not the same color, identify all the coloring program
zhongzhilvbo
- 图象柔化化的一种，中值滤波，能很快速的实现图象的柔化，图象的边缘保持不变．-image of a soft, the median filter can achieve very rapid images of soft, the edges in the image remains unchanged.
GetDegree
- 通过输入来控制是建立有向图还是无向图，输入节点数，边数，来计算每个节点的出度和如度-adopted to control importation is to establish a map or no map to the input nodes, edges, to calculate each node degrees out and if degrees
pulse_Measure1
- 上、下边沿开始测量脉冲脉宽，以及整个脉冲的宽度-upper and lower edges began measuring pulse, and the whole pulse width
Dijkstra_c
- C#中实现最短路，该图算法描述的是这样的场景：图由节点和带有方向的边构成，每条边都有相应的权值，路径规划（最短路径）算法就是要找出从节点A到节点B的累积权值最小的路径。-achieve the most short-circuit, the algorithm described in the plan that is the scene : map with nodes and from the direction of the edges, and each side has a corre
GrfxProgPHIGS
- Intro/: Directory containing introductory examples. HelloWorld.c A simple program that draws a box and writes \"Hello World\" in HelloWorld.f it. data The data file for the introductory progressive example. Lines.c Reads the data from
LevelSet_CV
- 实现无边界主动轮廓的的很好的算法，是论文“active contour without edges”的源码。
bumpy_sphere.off
- simple mesh file contains vertex, edges. no texture or color.
redundantpaths
- c pgm to find redundant paths in a graph.Many fault-tolerant network algorithms rely on an underlying assumption that there are possibly distinct network paths between a source-destination pair. Given a directed graph as input, write a program that u
xmouse
- The all mighty mouse: you can have more memory, you can have blue-ray discs but you are still using the mouse (and the keyboard) to control your computer. The mouse pointer lets you select objects on the screen and operate on them. What and how
synchronisation
- This circuit is a nice edge detector that gives you synchronous notification of edges on your input signal. There s no excuse for not doing this it s a tiny circuit in just five lines of Verilog.-This circuit is a nice edge detector that gives yo
GraphTraversal
- 使用c语言，利用数据结构思想建立图的邻接表的存储结构，实现无向图的深度优先遍历和广度优先遍历。以用户指定的顶点为起点，分别输出每种遍历下的顶点访问序列。 设图的顶点不超过30个，每个顶点用一个编号表示（如果一个图有N个顶点，则它们的编号分别为1，2，…，N）。通过输入图的全部边输入一个图，每条边是两个顶点编号对，可以对边依附顶点编号的输入顺序作出限制（例如从小到大）。 -Using c language data structure used to establish the adjac
IceTabSet
- This component is a Google Chrome style TTabSet component for Delphi. Required: - Delphi GDI+ API (http://www.progdigy.com/files/gdiplus.zip) Features: - Show icon in tab items - Gradient color tab and component background -
Graph
- Graph builder. Create vertices and edges.
yaoshi
- 演示怎么通过DELPHI控制程序修改系统字体质量，圆滑边缘等设置。-Demonstrates how to modify the system by DELPHI font quality control procedures, smooth edges and other settings.
Source
- edges of realistic clouds
homer.off
- homer 3d off file. OFF varetex - 5103 edges - 10202 file from http://shapes.aimatshape.net
face-YO.off
- simple mesh file contains vertex, edges. no texture or color.
octa-flower.ply2
- simple mesh file contains vertex, edges. no texture or color.