1. What are permutations and combinations? | ![]() |
2. How do permutations and combinations relate to the shortest paths problem? | ![]() |
3. What techniques can be used to find the shortest paths using permutations and combinations? | ![]() |
4. Can permutations and combinations be applied to any graph or network? | ![]() |
5. Are there any limitations or constraints when using permutations and combinations for the shortest paths problem? | ![]() |