N0080. 20260923-小菊的寻宝之旅

from typing import List
from collections import deque

class Solution:
    def shortestPath(self, n: int, edges: List[List[int]], s: int, t: int) -> int:
        return -1

def main():
    n = int(input().strip())
    
    m = int(input().strip())
    
    edges = []
    if m > 0:
        edge_parts = input().strip().split()
        for part in edge_parts:
            u, v = map(int, part.split(','))
            edges.append([u, v])
    
    s, t = map(int, input().strip().split())
    
    sol = Solution()
    print(sol.shortestPath(n, edges, s, t))

if __name__ == "__main__":
    main()