I have a directed graph, and some algorithms in networkx I want to apply to it. Unfortunately when I try to use the algorithms, python tells me that they're only implemented for undirected graphs so far, not directed graphs yet. I don't really want to reimplement these algorithms myself, is there a way to model my directed graph as an undirected graph?
Ultimately, my goal is to identify nodes in the graph that can be removed with minimum disruption. I could just perform reference counting, but this would fail because of cycles. My cycle detection algorithm is one that wasn't yet implemented for digraphs. Likewise for the community detection algorithms. My graph is relatively sparse: it has 1600 nodes but most node has less than 10 outgoing edges, and no node has more than 100.