搜索资源列表
VCNET实现的CAD开发系统
- 用VC NET实现的CAD开发源程序， 包括画直线，圆弧，多边形，图形打印等。 -VC NET development of CAD source, including drawing straight lines, arcs, and polygons, graphics printing.
drawcubic
- 此程序用QuadCurve2D产生有一个控制电和两个重点的quadratic curve，并允许通过改变控制电或曲线重点的位置来绘制弧线-this procedure with a QuadCurve2D produce electricity and control of two key quadratic curve, and allow control by changing the curve -- or to focus on
line_polygon_arcs
- 采用VC++.NET编写的画线、画矩形、椭圆、弧线和多边形及折线Graphic方法。-using VC.NET prepared by the line drawing, painting rectangular, oval, arcs and polygons and dogleg Graphic methods.
view238
- The view238 application is a simple tool for graphically displaying STEP-NC toolpaths. It is a Java application that reads AP-238 XML data using the DOM inferface, then finds and display the toolpaths within. At present,
stockchartx
- 支持所有流行的股票图表显示格式：Candlestick、 OHLCV、OHLC、和HLC、Darvas Boxes、3D Candlesticks、Renko、Kagi、Three Line Break、Point 、Figure、Candlevolume、Equivolume、Shaded Equivolume。每一个图表风格可以实时更新。 实时自动技术分析更新。 支持创建Line Studies，如Ellipse, Re
Improving
- Each arc of a binary-state network has good/bad states. The system reliability, the probability that source s communicates with sink t, can be computed in terms of minimal paths (MPs). An MP is an ordered sequence of
Reliability
- A stochastic-flow network consists of a set of nodes, including source nodes which supply various resources and sink nodes at which resource demands take place, and a collection of arcs whose capacities have multiple o
RF design example
- circles Various circle equations gain Constant gain circles noise Constant noise circles quality Constant Qn circles stability Stability circles conversion Conversion routines between different twoport network representa
drawcubic
- 此程序用QuadCurve2D产生有一个控制电和两个重点的quadratic curve，并允许通过改变控制电或曲线重点的位置来绘制弧线-this procedure with a QuadCurve2D produce electricity and control of two key quadratic curve, and allow control by changing the curve-- or to focus on
VCNET实现的CAD开发系统
- 用VC NET实现的CAD开发源程序， 包括画直线，圆弧，多边形，图形打印等。 -VC NET development of CAD source, including drawing straight lines, arcs, and polygons, graphics printing.
line_polygon_arcs
- 采用VC++.NET编写的画线、画矩形、椭圆、弧线和多边形及折线Graphic方法。-using VC.NET prepared by the line drawing, painting rectangular, oval, arcs and polygons and dogleg Graphic methods.
view238
- The view238 application is a simple tool for graphically displaying STEP-NC toolpaths. It is a Java application that reads AP-238 XML data using the DOM inferface, then finds and display the toolpaths within. At present,
Improving
- Each arc of a binary-state network has good/bad states. The system reliability, the probability that source s communicates with sink t, can be computed in terms of minimal paths (MPs). An MP is an ordered sequence of
Reliability
- A stochastic-flow network consists of a set of nodes, including source nodes which supply various resources and sink nodes at which resource demands take place, and a collection of arcs whose capacities have multiple o
tushendu
- 图的深度遍历，输出结果为（红色为键盘输入的数据，权值都置为1）： 输入顶点数和弧数:8 9 输入8个顶点. 输入顶点0:a 输入顶点1:b 输入顶点2:c 输入顶点3:d 输入顶点4:e 输入顶点5:f 输入顶点6:g 输入顶点7:h 输入9条弧. 输入弧0:a b 1 输入弧1:b d 1 输入弧2:b e 1 输入弧3:d h 1
ZUIDUAN
- 本文提出了一种基于矢量角度的最短路径搜索算法，设计出一种类似于面向对象的数据存储结构来存储网络图中的节点及弧段对象，在最短路径的搜索上引入矢量夹角标量值做为搜索因子，充分利用了网络图中各点元素和线元素间的拓扑关系，提高了搜索的趋势性，同时还考虑了各弧段的长度值（或权值），较好的将网络图中对象的空间信息和属性信息相结合-In this paper, a vector-based perspective of the shortest pa
btree
- Trees are natural structures for representing certain kinds of hierarchical data. A (rooted) tree consists of a set of nodes (or vertices) and a set of arcs (or edges). -Trees are natural structures for representing cert
daoyou
- if(v0==y)return "请正确选择景点" int v,w,i,j,min CString s1 bool final[num] int d[num] for(i=0 i<num i++) for(j=0 j<num j++) p[i][j]=-1 for(v=0 v<num v++){ final[v]=false d[v]=
fitellipse
- opencv 椭圆拟合的c++语言实现的代码-opencv fitting elliptical c++ language code
M
- Implementation of Edmonds Karp algorithm that calculates maxFlow of graph. Input: For each test case, the first line contains the number of vertices (n) and the number of arcs (m). Then, there exist m lines, one for