In some GRAPHs, the shortest path is given by optimizing two different metrics: the sum of weights of the edges and the number of edges. For example: if two paths with equal cost exist then, the path with the least number of edges is chosen as the shortest path. Given this metric, you have find out the shortest path between a given pair of vertices in the input GRAPH. The output should be the number of edges on the path, the cost of the shortest path, and the path itself. Input is the adjacency matrix and the two vertices.
标签： optimizing different the shortest
上传时间： 2014-10-25
上传用户：1159797854
Specification File adjacencyListGragh class GeneralGRAPH: use adjacency list to implement the GRAPH which data structure is vector Construct methods: * public GeneralGRAPH(): contain an empty vector store the vertex and a boolean determines whether GRAPH is directed or not, defaulted is undirected
标签： adjacencyListGragh Specification GeneralGRAPH adjacency
上传时间： 2013-12-13
上传用户：lyy1234
This program illustrates the effect of alising of frequency leading to signal distortion,the output GRAPH illustrates frequency respose due to alliasing,easy for students learning DSP
标签： illustrates distortion frequency the
上传时间： 2017-05-30
上传用户：daguda
Program to plot x(t) =1/2+∑_(n=1)^∞▒ (sinc 〖n/2〗 〖 cos 〗 〖2πnt/4〗 ) Include n-value (Number of Terms) in GRAPH on plot. Show 2 GRAPHs, original and simulated together.
上传时间： 2014-01-03
上传用户：tb_6877751
Because WDM networks are circuit switched loss networks blocking may occur because of lack of resources. Also in circuit switched networks many paths use the same links. This toolbox answers the question how different paths with different loads influence on each other and what is the blocking on each of the defined path. Toolbox is capable of computing blocking for three different WDM network types: with no wavelength conversion, with full wavelength conversion and with limited range wavelength conversion. It is worth noting that case for full conversion can be usefull for any circuit switched network without additional constraints (i.e. wavelength continuity constraint in WDM), for example telephone network. Toolbox contains also scripts for defining network structures (random networks, user defined networks) and traffic matrixes. Three GRAPH algorithms for shortest path computation are also in this toolbox (they are used for traffic matrix creation).
标签： networks blocking switched Because
上传时间： 2017-07-28
上传用户：zhangzhenyu
此文件夹中共包括十二个小程序 AVL创建平衡二叉树,通过加入一个个的结点创建,并实现了平衡二叉树中的结点删除 Boyer_Moore算法的串模式匹配 Horspool算法的串模式匹配 GRAPH实现了有向图的非递归广度优先遍历及非递归深度优先遍历 HeapSort利用堆排序实现优先级队列 Merge实现二路归并排序算法 MFK动态规划解背包问题 nqueue求解n皇后问题 QuickSort快速排序算法的实现。 Shell排序算法的实现。 Tree程序中实现了先序\中序\后序遍历二叉树的非递归算法。 tubao用递归法解决突包问题
标签： Boyer_Moore Horspool Grap AVL
上传时间： 2017-08-08
上传用户：佳期如梦
13、堆 MinHeap.h test.cpp 14、哈夫曼树 BinTreeNode.h BinaryTree.h MinHeap.h Huffman.h Test.cpp 15、树 164 QueueNode.h LinkQueue.h TreeNode.h Tree.h 170 test.cpp 16、B+树 BTreeNode.h BTree.h 192 test.cpp 17、图 217 MinHeap.h Edge.h 222 Vertex.h GRAPH.h 224 test.cpp 18、排序 Data.h 249 QueueNode.h LinkQueue.h Sort.h 263 test.cpp
标签： MinHeap BinTreeNode BinaryTree Huffman
上传时间： 2017-08-14
上传用户：AbuGe
The task in this assignment is to implement an airline routing system. Your system should be able to read in a ight network as a GRAPH from a le, where airports are represented as vertices and ights between airports are represented as edges, take as input two airports and calculate the shortest route (ie path) between them.
标签： system assignment implement airline
上传时间： 2017-09-07
上传用户：kiklkook
Description Scientific calculator. Allows to perform caclulation with high precicion and implements most populatr mathematical functions: sin, cos, tan, asin, acon, atan, exp, log, sqr, floor and ceil. Also it make it possible to define your own function, store results in variables and use variable sin expressions. Calculator store al formuls you have entered. Plot function can be used to draw GRAPH of function with single argument. More detailed description of calculator is here.
标签： Description caclulation Scientific calculator
上传时间： 2014-01-25
上传用户：familiarsmile
在图形中若于个边(edge)上加上一些值，此数值称为比重( weight ) 。而此图形称为比重图形(Weight GRAPH ) ，若weight是成本( cost )或距离( distance ) ，则称此图形为网路( Network )。根据Spanning Tree的定义，知一个图形可有许多不同spanning tree ，在network中找出一个具有最小成本( Cost )的Spanning tree ，则此Spanning tree称为最小成本生成树。
上传时间： 2013-12-28
上传用户：Shaikh
