Yes, the nx.edge_disjoint_paths function in NetworkX finds all the edge-disjoint paths between a pair of nodes(source and target) in a graph. This function returns a generator that yields lists of edge-disjoint paths between the specified nodes(source and target) in the graph. Each list represents a path.