搜索资源列表
89346515John.Wiley.and.Sons.Essentials.of.Error.Co
- 网络编码的提出彻底地改变了计算机通信网络中的信息处理方式，其研究结合了信息论、计算机通信网络、 组播技术、多用户信息论和图论等很多方面的知识。文中简要介绍了网络编码的基本原理，线性网络编码的基本概念及其发 展，并且提出一种实现线性网络编码的算法。-Its research involves the knowledge about information theory, computer communication networks, multicast technique, mul
shortpath
- 最短路径算法模拟 图的存储结构 熟悉掌握图中最短路径的算法 -The shortest path algorithm simulated map storage structure as familiarity with the shortest path algorithm for graph
GraphTheoryAlgorithmAndMATLABcode
- 图论算法和Ｍａｔｌａｂ实现该算法的源代码-Graph theory, algorithms and Matlab source code of the algorithm
AnExperimentalComparisonOfModernMethodsOfSegmentat
- 本文主要是比较图论分割和主动轮廓分割算法，通过实验可以看出分割的好坏-This article is to compare the segmentation and active contour graph partitioning algorithm, Experimental results show the good and bad segmentation
Deikstra
- For a given source vertex (node) in the graph, the algorithm finds the path with lowest cost (i.e. the shortest path) between that vertex and every other vertex.
1
- 给定一个有向图，实现图的深度优先, 广度优先遍历算法，拓扑有序序列，并输出相关结果。 功能要求：输入图的基本信息，并建立图存储结构（有相应提示），输出遍历序列，然后进行拓扑排序，并测试该图是否为有向无环图，并输出拓扑序列-Given a directed graph, realize the depth chart first, breadth-first traversal algorithm, topology and orderly sequence, and outputs the
branchandbound
- The basis of branch and bound algorithms is a ranking function. The ranking function assigns a value to each node in the graph. At each step, a branch and bound algorithm uses the ranking function to decide which node to expand next. In contrast, the
mofangzhen
- 1. 设计数据结构； 2. 设计算法完成任意n阶魔方阵的填数； 3. 分析算法的时间复杂度 魔方阵，又叫幻方阵，在我国古代称为“纵横图”。它是在一个n*n的矩阵中填入1到n*n的数字(n为奇数)，使得每一行，每一列，每条对角线的累加和都相等。-Design data structure design algorithm to complete the fill in the number of arbitrary order n magic square time complex
tu
- 实验要求：（1）理解图顶点和边的存储方法：邻接矩阵和邻接表；（2）理解图的遍历算法，掌握其应用；（3）应用图的遍历算法判断图是否连通和两顶点间是否存在路径。-Experimental requirements: (1) to understand the storage method: Figure the vertices and edges adjacency matrix and adjacency list (2) to understand graph traversal algor
kmeans_report
- 数据挖掘kmeans图像聚类实验报告 用 VC 或 Java 实现 k-means 聚类算法， 分别以迭代次数及分配不再发生变化为算法终止条件，用图片（自己选择）作为数据集，比较运行时间（画出时间与像素点的关系曲线图，因此须用多幅像素个数不同的图片进行实验） 提交实验报告与源代码。 -Data mining to achieve the k-means clustering algorithm the kmeans image clustering experiment report wit
xiongyali
- 匈牙利匹配算法,利用匈牙利匹配算法，解决图论中的最大匹配问题，-Hungarian matching algorithm using Hungarian matching algorithm to solve the maximum matching problem in graph theory,
c
- 分形彩图的C或者matlab的源代，可执行的绘制彩色分型算法图形的C或者matlab的源代码，需要3段，也就是3张图。图片尽可能好看-The fractal color of C or matlab source code, executable drawing color genotyping algorithm graph C or matlab source code need 3 paragraphs 3 in Fig. Picture as possible look good
asl
- sample code for aodv algorithm to find out the trace graph
floyd
- 此源码是算法floyd算法的实现,里面有我自己详细解说的几个重点，对于学习图论很有帮助，用于求任意两点间最短路径和路径长度-This source is the realization of the algorithm floyd algorithm, which has my own detailed explanation of several key helpful for learning graph theory, used to find the shortest path betw
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 develop an e±cient segmentation
POJ-project-training
- POJ专题分类,按算法分类，包含基本算法、图算法、数据结构、简单搜索、动态规划、数学、数论、计算几何等-POJ thematic classification algorithm segments, including basic algorithms, graph algorithms, data structures, a simple search, dynamic programming, mathematics, number theory, computational geometr
Kruska
- 编写算法能够建立带权图，并能够用Kruskal算法求该图的最小生成树。-Write an algorithm that can establish a weighted graph, and the ability to use the Kruskal algorithm for minimum spanning tree of the graph.
Topsort.cpp
- Topsort algorithm on directed acyclic graph.
PrimKruska
- 软件设计课程 软件设计作业 最小生成树算法最小生成树是数据结构中图的一种重要应用，它的要求是从一个带权无向完全图中选择n－1条边并使这个图仍然连通（也即得到了一棵生成树）,同时还要考虑使树的权最小 -Software Design Software Design course work minimum spanning tree algorithm minimum spanning tree data structure diagram is an important application o
tulunzuiduanlumatlabcode
- 解决图论中最短路问题的最好方法--“Dijstra算法,”通过解析实例模型,对模型算法进行描述、拓展,并给出了求最短路以及求最短路长的MATLAB程序,此程序具有通用性。-The best way to solve the shortest path problem in graph theory is- "Dijstra algorithm," by parsing instance model, the model describes the algorithm, expand, and g