在GRAPH中找出K條最短路徑,並且輸出到SP.txt檔中
上传时间： 2013-12-16
上传用户：zsjzc
forming of a signal, GLONASS system, coherent reception, graph autocorrelation, crosscorrelation function, bit-error probability[SNR]
标签： crosscorrelation autocorrelation reception coherent
上传时间： 2013-12-27
上传用户：小鹏
simple link list program
上传时间： 2014-01-12
上传用户：lhc9102
c pgm to find redundant paths in a graph.Many fault-tolerant network algorithms rely on an underlying assumption that there are possibly distinct network paths between a source-destination pair. Given a directed graph as input, write a program that uses depth-first search to determine all such paths. Note that, these paths are not vertex-disjoint i.e., the vertices may repeat but they are all edge-disjoint i.e., no two paths have the same edges. The input is the adjacency matrix of a directed acyclic graph and a pair(s) of source and destination vertices and the output should be the number of such disjoint paths and the paths themselves on separate lines. In case of multiple paths the output should be in order of paths with minimum vertices first. In case of tie the vertex number should be taken in consideration for ordering.
标签： fault-tolerant algorithms redundant underlyin
上传时间： 2013-12-18
上传用户：jkhjkh1982
Write a program to decide if a graph has a cycle or not. The given graph can be a directed or undirected graph, which is indicated at the time of reading the input (0 for directed graph and 1 for undirected graphs). The input is given as an adjacency list.
标签： graph directed program decide
上传时间： 2013-12-23
上传用户：cursor
Shortest Paths with Multiplicative Cost. In a given undirected graph, the path cost is measured as a product of all the edges in the path. The weights are rational numbers (e.g., 0.25, 0.75, 3.75 etc) or integers (2, 3). There are no negative edges. Given such a graph as input, you are to output the shortest path between any two given vertices. Input is the adjacency matrix and the two vertices. You must output the path.
标签： Multiplicative undirected Shortest measured
上传时间： 2017-04-08
上传用户：邶刖
Edge Disjoint Cycles. You are given an input graph that is either directed or undirected. Write a program that reads in a vertex number and lists the number of edge disjoint cycles that start and end at this vertex. The output should also list the edges in each of the cycle discovered. Input will be the adjacency matrix preceded by a 0 or 1 representing Directed or Undirected graphs respectively.
标签： undirected Disjoint directed Cycles
上传时间： 2017-04-08
上传用户：13188549192
This model simulates a CDMA2000 1xRTT Forward link (between Base Station and Mobile Station)
标签： Station simulates Forward between
上传时间： 2013-12-14
上传用户：13188549192
this program is about logic and have 4 class. for execute this program use of link list.
标签： program this execute about
上传时间： 2013-12-23
上传用户：wcl168881111111
CATIA二次开发:如何通过VBA获取part 中的link
上传时间： 2017-04-12
上传用户：爱死爱死
