Assistant: 
User: Please generate a unique JSON object suitable for automating the programming task testing platform, strictly in the following format:
{
  "Title": "Task Name",
  "Task Description": "Description of the task.",
  "Function Signature": "def function_name(parameters) -> return_type:",
  "Solve": "",
  "Input": "Description of the input parameters.",
  "Output": "Description of the expected output.",
  "Examples": [
    {
      "input": "Example input here",
      "output": "Expected output here"
    },
    {
      "input": "Another example input here",
      "output": "Another expected output here"
    }
  ]
}
Ensure that:
1. The task includes graph traversal algorithms.
2. The JSON follows this exact structure and does not include any additional text or variations.
3. The task should be complex and unique, avoiding direct copying from common platforms like LeetCode or similar sources.
4. The solution must not use any imports in the code (i.e., no import statements).
5. The 'Solve' section must remain empty.
6. Ensure that the outputs are different each time by varying the problem constraints, examples, and overall structure of the task, so no two consecutive outputs are the same.
7. Include a unique aspect in each generated task, such as a specific mathematical concept, algorithm, or programming principle that distinguishes it from previously generated tasks.
8. The 'Function Signature' should strictly follow the format: 'def function_name(parameters) -> return_type:', but the 'Solve' section must remain empty. Ensure that the input description corresponds to the expected parameters in the signature.

Ensure that the solution must not be any of the following titles:
- Matrix Spiral Traversal
- String Compression with Character Count
- Custom Weighted Quick Sort
- Custom Radix Sort with Base Conversion
- Maximum Non-Adjacent Sum
- Longest Palindromic Subsequence with Constraints
- Unique Path Count in a Grid
- Minimum Cost Path with Dynamic Constraints
- Custom Bucket Sort with Dynamic Range
- Graph Cycle Detection
- Optimal Coin Change with Limited Supply
- Nested List Sum with Depth Weighting
- Island Count in a Grid
- Custom Merge Sort with Inversion Count
- Nested List Product with Depth Weighting
- Optimal Partition of Array into Subarrays
- Custom Frequency-Based Sort
- Binary Tree Depth with Specific Leaf Condition
- Custom Heap Sort with Dynamic Priority
- Nested Parentheses Balancing
- Dynamic Subset Sum with Constraints
- Graph Colorability Check
- Distinct Character Block Reversal
- String Pattern Expansion
- Custom Frequency-Based Sorting with Prime Factorization
- Graph Path Finder with Constraints
- Lexicographical Permutation Sort
- Custom Sorting with Prime Factorization
- Dynamic Subarray Maximum Product
- Custom Sorting with Fibonacci Weighting
- String Transformation with Vowel Manipulation
- Substring Anagram Finder
- Dynamic Subsequence Sum with Constraints
- Dynamic Fibonacci Sequence with Constraints
- Weighted Graph Shortest Path with Constraints
- Graph Connectivity Checker
- Custom Sorting with Geometric Progression Weighting
- Nested List Depth Calculation
- Custom Sorting with Geometric Sequence Weighting
- String Transformation with Character Shifting
- String Transformation with ASCII Manipulation
- Graph Traversal with Unique Path Constraints
- Graph Traversal with Unique Node Constraints
- String Transformation with Unique Character Count
Assistant: