'Find all disjoint connected paths in a graph

I have k pairs of starting points and end points on a graph.

enter image description here

As shown in the picture, I dyed the different pair in different colors.

I need to connect them two by two.

Each node can only be passed through once, and cannot pass through the starting points of other colors.

The problem is to output the number of solutions that satisfy this constraint, and output 0 if there is no solution.

Does this problem have a well known name, is there any library to solve this problem?

graph


Sources

This article follows the attribution requirements of Stack Overflow and is licensed under CC BY-SA 3.0.

Source: Stack Overflow

Solution Source

Related Questions