搜索资源列表
choose_best_address
- 数据结构 寻径问题。内容：给定n个村庄之间的交通图，若村庄i和村庄j之间有道路，则将顶点i和顶点j用边连接，边上的权Wij 表示这条道路的长度。现在要从这n个村庄选择一个村庄建一所医院，问这所医院应建在哪个村庄，才能使离医院最远的村庄到医院的距离最短？-Routing data structure problem. Content: Given n traffic between villages map, if the village i and the road between the vi
edgedetector
- canny detector code which performs extracting edges from a image and gives efficient results compared to other methods
xiaoyuan
- 校园导航程序，支持任意数的顶点和边数，直接输入即可，可以查询两点间的所有路径，最短距离，Dijstra和Floyd算法都有-Campus navigation, support for any number of vertices and edges, can be directly input, you can query all paths between two points, the shortest distance, Dijstra and Floyd algorithm has
exp6
- 合肥工业大学数据结构试验六图结构试验 包括完整的实验要求、实验预习报告、实验最终报告 实验要求： <1>求给定图中的边（或弧）的数目。 <2>求解出从给定顶点到所有顶点的最短路径（以边数计算）。 <3>判断一个有向图g是否是一棵有向树。（任意一个顶点可能是根） <4>对给定的图G及出发点v0，设计算法从V0出发深度遍历图G，并构造出相应的生成树。 -Hefei University of testing six graph
edge_detection
- Edge detection is a feature of this Code and you can find out the edges of an image seamelessly using matlab by this code
XGraph2
- 能够建立有向图无向图的邻接矩阵和邻接表表示法，深度优先和广度优先搜索，能够存储和显示相应的搜索结果（深度优先或广度优先生成森林（或生成树）、深度优先或广度优先序列和编号）。以文件形式输入图的顶点和边，并显示相应的结果。-To build a directed graph undirected adjacency matrix and adjacency list representation, depth-first and breadth-first search, to store and
Manhattan
- 在 VLSI 设计中,多点互连是物理设计阶段的关键问题之一,而互连的点数等于 2 或大于 2 分别对应于 Manhattan 空间上有障碍时的最短路径问题和最小 Steiner 树问题,显然前者是后者的基础.连接图是研究最短路径 问题的有效工具,已有的典型连接图包括基于轨迹的GC 和GT 以及基于自由区的GF 和GG.工作包括3个方面:设计并分析了在各种连接图上实现动态的点对之间的最短路径查询算法 分析了在各个连接图上构造 3-Steiner 树的算 法,对于已有的 GC 上的 3-
7e2e8454dbc4
- detection of edges and segmenting the images
faraday1
- 这个例子显示了如何使用stretchmesh功能 扩大不增加人数的gridpoints在边缘计算窗口的大小。 -This example shows how to use the stretchmesh function to expand the size of the computation window at the edges without increasing the number of gridpoints.
edgedetect
- these codes can be used to detect edges in an image
imagdetect
- 学习matlab图像处理的绝对有用的程序，所有程序均调试通过，程序代码说明 P0401：用Prewitt算子检测图像的边缘 P0402：用不同σ值的LoG算子检测图像的边缘 P0403：用Canny算子检测图像的边缘 P0404：图像的阈值分割 P0405：用水线阈值法分割图像 P0406：对矩阵进行四叉树分解 P0407：将图像分为文字和非文字的两个类别 P0408：形态学梯度检测二值图像的边缘 P0409：形态学实例——从PCB图像中删除所有电流线，仅保留
MeshTransform
- MeshTransform.m Descr iption: convert Gambit s .neu mesh into points edges cells files Sheng Chen ICME, Stanford University Febrary 02, 2006 Modified 21st August, 2007 ((((1.)))VERY VERY IMPORTANT ====> This
neu2suntans
- NEU2SUNTANS Convert Gambit .neu file to suntans readable grid. NEU2SUNTANS(MESH_FILE,DATADIR) reads the .neu file specified by MESH_FILE and creates the points.dat, edges.dat, cells.dat files that are used by SUNTANS in the directory specif
guandao
- 输入顶点的序列及边和顶点之间的关系就可以通过该程序输出最小生成树的各条边以及边上的权值；-Enter the sequence of vertices and edges and vertices of the relationship between the program output by the minimum spanning tree and the edge of each side of the weight
DijkstraThreads.tar
- Multi Thread Implementation of Dijkstra s Shortest Path Algorithm All-to-all. It reads a file in the format: Edges Nodes start end weight Like this: 20 5 1 2 5 1 3 4 2 1 3 2-Multi Thread Implementation of Dijkstra s Shortest P
graph
- 用邻接表的方式建立一个图，可以对这个图进行删除边，增加边，删除增加节点，和深度广度优先搜索-With the adjacency list of ways to build a map, you can delete the edges of this graph, increasing side, remove the added nodes, and depth of breadth-first search
matlab4
- This paper presents a fuzzy topology-based method to facilitate the use of larger gradient kernels. The new method effectively limits the response area around the edge and prevents neighboring objects to affect each other. Synthetic images are used t
matlab55
- This paper presents a fuzzy topology-based method to facilitate the use of larger gradient kernels. The new method effectively limits the response area around the edge and prevents neighboring objects to affect each other. Synthetic images are used t
Finding-edges-of-a-color-image
- 可以实现一幅图像中彩色边缘的提取，实在matlab的条件下，有多种算子-Can achieve a color image edge extraction, it is matlab conditions, a variety of operator
tubao
- 一种新的最小凸包算法及其应用，在64*64大小的矩形内，生成任意个（可输入）点的x,y坐标 在最短的时间内计算出包含这些点的凸包-Edges of the edge detection and the points listed