I am trying to find the independent cycles coming out from from a specific node in a graph in netowrkx. The algorithms there are implemented for undirected (with an option for node) and for undirected (without an option for node selection).
Conversion from undirected to directed will not work since you lose some edges. Using multigraph will also not work since the algorithm of cycles is only implemented for undirected graphs. Any idea?