搜索：adjacency
找到约 6 项符合「adjacency」的查询结果
结果 6
按分类筛选
https://www.eeworm.com/dl/633/441581.html
Java编程
Specification File adjacencyListGragh class GeneralGraph: use adjacency list to implement the gr
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, de ...
https://www.eeworm.com/dl/534/425102.html
其他
Write a program to decide if a graph has a cycle or not. The given graph can be a directed or undire
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.
https://www.eeworm.com/dl/534/425107.html
其他
Edge Disjoint Cycles. You are given an input graph that is either directed or undirected. Write a pr
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 disco ...
https://www.eeworm.com/dl/534/425105.html
其他
Shortest Paths with Multiplicative Cost. In a given undirected graph, the path cost is measured as a
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, y ...
https://www.eeworm.com/dl/534/425106.html
其他
In some graphs, the shortest path is given by optimizing two different metrics: the sum of weights o
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 ...
https://www.eeworm.com/dl/628/425099.html
编译器/解释器
c pgm to find redundant paths in a graph.Many fault-tolerant network algorithms rely on an underlyin
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 dete ...