Adam Li
Adam Li
No, but one can possibly just convert to an undirected graph and then run: https://networkx.org/documentation/stable/reference/algorithms/generated/networkx.algorithms.simple_paths.all_simple_paths.html#all-simple-paths Not "as efficient" cuz of the conversion, but we can just leave an in-line comment...
Yeah I think it's pretty inefficient, but the only other way I can think of is a BFS/DFS style algorithm that just keeps track of edge types along each path....
In a more general case, we also have the case of an ADMG and a MAG. In the case of a MAG, the difference is that there is only one...
> So the way i would imagine it is we have a base directed-undirected edge graph class, and then constructors for each type of graph that enforce whatever requirements the...
This is mainly for robustness and error-checking within the export submodule
> As far as names we could always go DUGraph, DBGraph, DBCUGraph. I am still of the opinion that we should create an API so that users don't have to...
As an aside, seeing the implementation of CG and CPDAG as a subclass of DUGraph, I'm pondering the tradeoffs here: 1. Support explicit causal graph classes: Can we guarantee at...
cc: @robertness @bloebp @kunwuz
Discussion with @jaron-lee we have decided the following strategy: - Implement 4 private abstractions on top of `MixedEdgeGraph` that enables all causal-type graphs: DiBiGraph, DiUnGraph, DiBiUnGraph, DiBiUnCiGraph - Still support...