搜索资源列表
Snakes_Active_Contour_models_Image_Process_GVF
- 图像处理的关于Snakes : Active Contour Models算法和水平集以及GVF的几篇文章,文章列表为: [1]Snakes Active Contour Models.pdf [2]Multiscale Active Contours.pdf [3]Snakes, shapes, and gradient vector flow.pdf [4]Motion of level sets by mean curvature I.pdf [5]Spectral S
PolygonGame
- 多边形游戏,实现多条边之间的+与*运算的算法,并求得断掉不同边中的最大值-Polygon games, multi-edges between the+ and* operation of the algorithm and obtained a different side of the maximum cut off
SCC
- Java实现的图的强连通分支算法,可以输入图的节点和边,并返回图中所有的强连通分支-Java to achieve strong connectivity of the graph branch algorithm, can enter graph nodes and edges, and return to map all of the strongly connected branch
BC
- Java实现的双连通分支算法,可以自行输入图的节点和边,并返回图中所有的双连通分支-Java connectivity to achieve the two-branch algorithm, can enter the graph nodes and edges, and return to map all of the dual-branch connectivity
pacman
- its a cool game that breaks the screen on the edges if you break ur screen fucking cool -its a cool game that breaks the screen on the edges if you break ur screen fucking cool haha
RockAndRoll
- Simplified version of a system that finds the fastest or shortest trip along a network of roads, is an instance of the single-source, positive-weighted, shortest-path problem. In other words, from one particular vertex (a “single source”), we’ll be f
server
- 设计一个应用程序,实现下列功能: 客户端:输入三个数,以逗号分隔,并发往服务器处理,接收并显示处理结果 服务器端:接收客户端送来的数据,计算以这三个数为边的三角形的面积。处理结果分为:1)数据格式异常;2)不能构成三角形;3)三角形的面积 注:自行选择所使用的协议(TCP/UDP)-Design an application to achieve the following functions: Client: Enter three numbers separated by com
cssmenu19
- 纯CSS实现的二级下拉列表菜单,菜单边缘都是圆角,可以应用到网站主页的菜单上 -Pure CSS to achieve the two drop-down list menu, the menu is rounded edges, can be applied to the site' s home page menu
AreaAndLength
- 类的封装 1. 实验目的 使用类来封装对象的属性和功能。 2. 实验要求 (1)编写一个简单的Java应用程序,该程序中定义3个类:Tangle、Lader和Circle,分别用来刻画“三角形”、“梯形”和“圆形”,具体要求如下: Tangle类具有类型为double的三条边,以及周长、面积属性,具有计算并返回周长、面积以及三条边的功能,另外还要具有一个boolean型的属性,用来判断三个数能否构成一个三角形。 Lander类具有类型为
edgedetection
- This source code is used for detecting edges of an image
CannyJava
- Canny Edge Detector which returns edges and gradient-angle fully written in java.
project3handout
- 使用Dijkstra方法实现的求最短路径,可以按规定格式读入文件,可以添加,删除节点,可以添加删除边-Implemented using the Dijkstra shortest path method, you can read the required file format, you can add, delete nodes, you can add and delete edges
web
- 网站的内容,就如同书的文字一般重要,书没有了内页,就算封面再漂亮、再精致,都只是个徒俱美丽空壳的纸版罢了;如果书的内容杂乱无章或是不切合书名,那么买书的人一定会非常懊恼也非常生气。网站也是一样的道理,如果网站没有内容,就算装扮得再美轮美奂,也不配称为网站;如果网站的内容杂七杂八或是与站名摸不着边儿,那么不小心踏进来的浏览者,必然会非常举丧也非常不悦。我做这个旅游网站主要分为旅游线路、机票服务、代办签证、包车服务、留言反馈这几个部分。还有一些其他的链接。-Content of the site,
graph-editor.jar
- Graph editor, allows to edit nodes/edges graphs with a simple piece of java code. Easy to include in an existing project.
Plotters
- DirectedGraph 形象化为拥有有限数量的 Node 的一个 2-D 图形,在该图形中,每个 Node 都位于一些 Point 上,相邻的 Node 是通过 Edges 连接在一起的。 -DirectedGraph visualized to have a limited number of Node 2-D graphics, in the graph, each Node are located on a number of Point, adjacent to the Nod
DrawShapes
- In the DrawShapes demo, we alternately create stars and donuts at mouse-click locations with random sizes inside a MouseListener implementation: To paint our custom component, we iterate through the list of shapes and fill each one in turn Finall
a
- 1) 利用求n!的方法计算 2!+4!+5!的值。分别利用递归和非递归方法实现求n!。 2) 编写根据三条边求三角形面积的方法。利用该方法求以下两个三角形面积。 (1)三条边分别为:3,4,5 (2)三条边分别为:5.3, 6.2, 8 3)从命令行参数获取两个整数,找出两个整数之间的所有素数,每行输出3个数。-1) use the method seek n! 2!+4!+5! Value. Are recursive and non recursive method seek
aaa
- 1) 在图形界面中绘制二维的坐标系统,其中x轴位于绘图区正中,y轴位于绘图区的最左边。 2) 根据下面试验数据,在1)题的坐标系统中绘制数据点,每个数据点用一个小叉号表示,并在叉号边以(x,y)的格式标示出数据点的坐标数值,最后用折线连接相邻的数据点。 数据点序号 x坐标 y坐标 1 0 20 2 50 -30 3 100 16 3 150 126 5 200 164 3) 在2)题的基础上设计界面接收用户输入的实验数据,绘制数据点和实验曲线。
MapEditApp
- 有向图编辑器 有向图中涉及到节点和有向边,分别用Node和Arrow来建模,考虑到Node和Arrow要被多个其他对象调用,直接处理开销比较大。可以利用设计模式中的代理模式创建NodeProxy和ArrowProxy实现对Node和Arrow的操作。-Directed graph editor Involved in a directed graph with nodes and directed edges, respectively, to the Node and Arrow mo
betweeness-of-edges
- 复杂网络中的边介数计算源代码,已通过编译。-calculate the betweeness of edges in complex networks.