[Swift]LeetCode847. 访问所有节点的最短路径 | Shortest Path Visiting All Nodes

★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★
➤微信公众号：山青咏芝（shanqingyongzhi）
➤博客园地址：山青咏芝（https://www.cnblogs.com/strengthen/）
➤GitHub地址：https://github.com/strengthen/LeetCode
➤原文地址： https://www.cnblogs.com/strengthen/p/10591816.html 
➤如果链接不是山青咏芝的博客园地址，则可能是爬取作者的文章。
➤原文已修改更新！强烈建议点击原文地址阅读！支持作者！支持原创！
★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★

An undirected, connected graph of N nodes (labeled 0, 1, 2, ..., N-1) is given as graph.

graph.length = N, and j != i is in the list graph[i] exactly once, if and only if nodes i and j are connected.

Return the length of the shortest path that visits every node. You may start and stop at any node, you may revisit nodes multiple times, and you may reuse edges.

Example 1:

Input: [[1,2,3],[0],[0],[0]]
Output: 4
Explanation: One possible path is [1,0,2,0,3]

Example 2:

Input: [[1],[0,2,4],[1,3,4],[2],[1,2]]
Output: 4
Explanation: One possible path is [0,1,4,2,3]

Note:

1. 1 <= graph.length <= 12
2. 0 <= graph[i].length < graph.length

---

给出 graph 为有 N 个节点（编号为 0, 1, 2, ..., N-1）的无向连通图。 

graph.length = N，且只有节点 i 和 j 连通时，j != i 在列表 graph[i] 中恰好出现一次。

返回能够访问所有节点的最短路径的长度。你可以在任一节点开始和停止，也可以多次重访节点，并且可以重用边。

示例 1：

输入：[[1,2,3],[0],[0],[0]]
输出：4
解释：一个可能的路径为 [1,0,2,0,3]

示例 2：

输入：[[1],[0,2,4],[1,3,4],[2],[1,2]]
输出：4
解释：一个可能的路径为 [0,1,4,2,3]

提示：

1. 1 <= graph.length <= 12
2. 0 <= graph[i].length < graph.length

---

Runtime: 240 ms

Memory Usage: 19.5 MB

class Solution {
    func shortestPathLength(_ graph: [[Int]]) -> Int {
        var n:Int = graph.count
        var fullMask:Int = (1 << n) - 1
        var visited:Set<String> = Set<String>()
        var que:[Node] = [Node]()
        for i in 0..<n
        {
            var node:Node = Node(i, 1<<i)
            que.append(node)
            visited.insert(node.toString())
        }
        var level:Int = 0
        while(!que.isEmpty)
        {
            var size:Int = que.count
            for i in 0..<size
            {
                var node = que.removeFirst()
                if node.mask == fullMask {return level}
                for next in graph[node.id]
                {
                    var nextNode:Node = Node(next, node.mask | (1 << next))
                    if visited.contains(nextNode.toString()) {continue}
                    que.append(nextNode)
                    visited.insert(nextNode.toString())
                }
            }
            level += 1
        }
        return level
    }
}

class Node {
    var id:Int = 0
    var mask:Int = 0
    
    init(_ id:Int,_ mask:Int)
    {
        self.id = id
        self.mask = mask        
    }
    
    func toString() -> String
    {
        return String(id) + " " + String(mask)
    }
}