Home > other >  O bosses help solve a python programming of directed graph
O bosses help solve a python programming of directed graph

Time:09-15

Input directed graph:



Input: collection [F2 and F6]
Collection (B1)
Output: sequence
{[' F2 ', 'F4', 'F1' and 'B1], [' F2', 'B1], [' F6', 'F5', 'F2', 'F4', 'F1' and 'B1], [' F6', 'F4', 'F1' and 'B1], [' F6', 'F5', 'F1' and 'B1], [' F6', 'F5', 'F2', 'B1]}

CodePudding user response:

What's the relationship between input and output? What are the specific requirements

CodePudding user response:

Input begins with a b1, the ending is F2 and f6 all paths??
  • Related