         let searchManager = SearchManager(withStart: start, end: end)
         
         XCTAssertTrue(searchManager.findPath())
-        let totalPath: Array<Node> = searchManager.recreatePath(end)
+        let totalPath = searchManager.recreatePath(end)
         
         XCTAssertEqual(3, totalPath.count)
         XCTAssertTrue(totalPath[0] === start)

        
        XCTAssertFalse(searchManager.findPath())
    }
}

    
    /**
     * Tests the case with two possible paths. The shortest first leg leads to the shortest path.
     * Diagram looks like: Start*---+A
     *                           \   \
     *                           B+---*End
     */
    func testTwoPathsTwoIntermediateNodesShortestFirstLegShortestPath() {
        let start = Node()
