DG-WIN: a program for determining path sets and cut sets for cyclic directed graphs
Dale V. Talbott, A. Sharif Heger · Transactions of the American Nuclear Society · 1991
This paper presents a new Microsoft Windows-based program for determining path sets and cut sets for a directed graph with cycles. Using directed graphs for modeling systems is a more general approach than using standard fault trees and event trees because it allows cycles and multiple sink nodes, which are similar to multiple fault-tree tops. In a directed graph, information flows from the source nodes to the sink nodes through many different pathways. The program, Directed Graphs for Windows (DG-WIN), has been applied successfully to a limited number of problems.