@@ -0,0 +1,961 @@
+package com.fishercoder.solutions;%0A%0A/**%0A * 847. Shortest Path Visiting All Nodes%0A *%0A * An undirected, connected graph of N nodes (labeled 0, 1, 2, ..., N-1) is given as graph.%0A * graph.length = N, and j != i is in the list graph%5Bi%5D exactly once, if and only if nodes i and j are connected.%0A * Return the length of the shortest path that visits every node.%0A * You may start and stop at any node, you may revisit nodes multiple times, and you may reuse edges.%0A *%0A * Example 1:%0A * Input: %5B%5B1,2,3%5D,%5B0%5D,%5B0%5D,%5B0%5D%5D%0A * Output: 4%0A * Explanation: One possible path is %5B1,0,2,0,3%5D%0A *%0A * Example 2:%0A * Input: %5B%5B1%5D,%5B0,2,4%5D,%5B1,3,4%5D,%5B2%5D,%5B1,2%5D%5D%0A * Output: 4%0A * Explanation: One possible path is %5B0,1,4,2,3%5D%0A *%0A * Note:%0A * 1 %3C= graph.length %3C= 12%0A * 0 %3C= graph%5Bi%5D.length %3C graph.length%0A * */%0Apublic class _847 %7B%0A    public static class Solution1 %7B%0A        public int shortestPathLength(int%5B%5D%5B%5D graph) %7B%0A            //TODO: implement this%0A            return -1;%0A        %7D%0A    %7D%0A%7D%0A

add skeleton for 847