I use an algorithm to infer a directed graph (containing cycles) that reflects interactions and feedbacks between variables from a floating-point dataset. I want to examine all DAGs (each contains all nodes) in this directed graph, but do not know whether there are algorithms that identify all DAGs in a directed graph. I have made internet search using cn.bing.com and google but do not find highly relevant answers.
↧