搜索资源列表
Prim
- 这是一个构造最小生成树的Prim算法，是属于贪心算法的范畴。设G=(V,E)是连同带权图，V={1，2，3，...，n}。构造G的最小生成树。-This is a structure of Prim minimum spanning tree algorithm is a greedy algorithm category. Set G = (V, E) is, together with the weighted graph, V =
GraphSeg
- This paper addresses the problem of segmenting an image into regions. We defi ne a predicate for measuring the evidence for a boundary between two regions using a graph-based representation of the image. We then dev
greedy-PEGASIS
- 在无线传感网络中，PEGASIS虽然不是严格的簇类协议，却延用了簇的思想。本程序在Ns2中进行模拟，使用贪心算法建立一条基于地理位置的链，即：PEGASIS中的簇。-In WSNs, PEGASIS routing protocol follows the idea of clustring though it is not a strict hierachical protocol. This program utilizes the
Dijkstra
- Dijkstra杰斯拉特的贪心算法程序，实现含权有向图G=(V,E)中顶点到其余顶点的距离。-The greedy algorithm Dijkstra Jess Lats procedures with the right vertex to the rest of the distance from the vertex to Figure G = (V, E).
segment
- We de¯ ne a predicate for measuring the evidence for a boundary between two regions using a graph-based representation of the image. We then develop an e±cient segmentation algorithm based on this predicate, an
seg-ijcv
- This paper addresses the problem of segmenting an image into regions. We de¯ ne a predicate for measuring the evidence for a boundary between two regions using a graph-based representation of the image. We then d
Prim101
- 这是一个构造最小生成树的Prim算法，是属于贪心算法的范畴。设G=(V,E)是连同带权图，V={1，2，3，...，n}。构造G的最小生成树。-This is a structure of Prim minimum spanning tree algorithm is a greedy algorithm category. Set G = (V, E) is, together with the weighted graph, V =
dijkstra
- 迪杰斯特拉算法计算最短路径Dijkstra算法是由E.W.Dijkstra于1959年提出，又叫迪杰斯特拉算法，它应用了贪心算法模式，是目前公认的最好的求解最短路径的方法。算法解决的是有向图中单个源点到其他顶点的最短路径问题，其主要特点是每次迭代时选择的下一个顶点是标记点之外距离源点最近的顶点。但由于dijkstra算法主要计算从源点到其他所有点的最短路径，所以算法的效率较低。-Dijkstra shortest path algori
DijkstraPath
- Dijkstra算法是由E.W.Dijkstra于1959年提出,又叫迪杰斯特拉算法,它应用了贪心算法模式,是目前公认的最好的求解最短路径的方法。-Dijkstra algorithm greedy algorithm mode, is widely recognized as the best method for solving the shortest path.
集合论 - 副本
- 选取一定点X0，连接距离其最近的顶点X1，再连接距X1最近的顶点X2，依次类推下去，直到最后目的地。 数学语言：贪心算法，在一给定的无向图G = (V, E) 中，(u, v) 代表连接顶点 u 与顶点 v 的边（即），而 w(u, v) 代表此边的权重，若存在 T 为 E 的子集（即）且为无循环图，使得 w(T) 最小，则此 T 为 G 的最小生成树。(Select a point X0, connect it from its n
e-greedy
- multi-armed bandit多臂*机算法中的e-greedy贪婪算法的基本仿真代码(multi-armed bandit e-greedy simulation program)