搜索资源列表
A_Bottom-U154180292003
- 有限状态机实现 It is an example of a bottom-up parser, using an algorithm I came up with. My bottom-up parser was completely hand-written, without any code generation. It s algoritm is centered around a finite-state machine code as a tree structure with s
classicladder-run.tar
- 电路仿真程序 Classic Ladder is coded 100％ in C.It can be used for educational purposes or anything you want... The graphical user interface uses GTK. In the actual version, the following elements are implemented : * Booleans elements * Rising
GlVideoManager
- VideoMan (Video Manager) is an open-source C++ library that helps you developing video based applications. We created VideoMan to increase our productivity developing computer vision applications, but it can be used in many other ways. With Vid
10.1.1.2.1828
- Active Contours Without Edges Tony F. Chan, Member, IEEE, and Luminita A. Vese
Traversing-Graph
- 以用户指定的结点为起点，分别输出深度优先遍历和广度优先遍历下的结点访问序列和相应生成树的边集-As a starting point to a user-specified node, respectively, to output the depth-first and breadth-first traversal node access to the sequence and the corresponding set of edges of the spanning tree
prim
- 假设G＝(V，E)是连通的，TE是G上最小生成树中边的集合。算法从U＝{u0}（u0∈V）、TE＝{}开始。重复执行下列操作： 在所有u∈U，v∈V－U的边(u，v)∈E中找一条权值最小的边(u0,v0)并入集合TE中，同时v0并入U，直到V＝U为止。-Suppose G = (V, E) is connected, TE minimum spanning tree of G on the set of edges. Algorithm from U = {u0} (u0 ∈ V), TE
Betweenness
- 这个程序可以用来计算复杂网络中的介数，稍微修改就可以实现边介数和点介数的计算。-This program can be used to calculate the number of referrals of complex networks, a slight modification can calculate the number of edges and points referral referral number.
Cpp1
- /*【4.5】全国著名景点导游咨询 [ 问题描述 ] 用无向网表示全国著名旅游景点平面图，图中顶点表示主要景点，存放景点编号、名称、简介、门票价格等信息，图中边表示景点间的道路，存放路程长度和行程费用信息。 [ 基本要求 ] （1）查询各景点的相关信息； （2）查询图中任意两个景点间的最短路径 （3）查询图中任意两个景点间的最经济路径 （4）根据游客计划的旅游费，为游客推荐最节省的旅游线路与景点*/-/* [4.5] famous attractions guide
fast_tone_mappping
- We use the code of our fast bilateral filter to implement a tone mapping operator inspired from this SIGGRAPH 02 paper by Frédo Durand and Julie Dorsey. This code is not an exact implementation of this paper. As such, it cannot be used for comparison
EdgeGlow
- This class performs the glow effect used at the edges of scrollable widgets.
homework2
- A finite state machine (FSM) is an abstract machine used to model a sequential system or a computer program. An FSM can be represented as a directed graph having a set of N nodes representing states connected with a given set of directed edges. A
SkOpSegment
- if the following span exists (not past the end, non-zero winding) connect the two edges. -if the following span exists (not past the end, non-zero winding) connect the two edges.
quad_f
- A Quad is defined by four corners, allowing it to have edges that are not axis-aligned, unlike a Rect.
u_texture
- @file Texture mapping utility functions.Compute sc = + -scale and tc = + -scale. Not + -1 to avoid cube face selection ambiguity near the edges, though that can still sometimes happen with this scale factor.
polygons
- This GM tests a grab-bag of convex and concave polygons. They are triangles, trapezoid, diamond, polygons with lots of edges, several concave polygons.. But rectangles are excluded.
loc_api_cb
- ensure that we don t accidentally screw up the bounds when the oval is fractional, and the impl computes the center and radii, and uses them to reconstruct the edges of the circle.
brw_clip_unfilled
- Calculate the vectors of two edges of the triangle:.
omxVCM4P10_DeblockChroma_I
- Descr iption: Performs deblocking filtering on all edges of the chroma macroblock (16x16).
SkEdgeBuilder
- returns the number of built edges. The array of those edge pointers is returned edgeList() Source Code for Embedded Linux. -returns the number of built edges. The array of those edge pointers is returned edgeList() Source Code for Embedded Linux.
38619213
- 其功能是实现对图象用Canny算子提取图象边缘,其中包含原始结果以及C代码,-Its function is to realize the image Canny operator was used to extract image edges, which contains the original results and C code,