虫虫首页| 资源下载| 资源专辑| 精品软件
登录| 注册

您现在的位置是：虫虫下载站 > 资源下载 > 编译器/解释器 > 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 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 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.

相 关 资 源

您 可 能 感 兴 趣 的

虫虫下载站版权所有 京ICP备2021023401号-1