/// Summary: Computes the shortest path to a node
	private Triple<String, Integer, LinkedList<String>>
	p_ComputeShortestPathTo_WithLinkedList(String nodeTo)
	{
		// Have to use hack - Java no can has closures
		m_OurPosition_MayBe_OUT_OF_DATE = p_MakePosString(m_curX, m_curY);
		HashMap<String, Tuple<Integer, String>> augmentedMap =
			p_ComputeSpanningTree_With_EndCondition_AndAddCondition(new AnonymousConditional_Single<String>(){

				@Override
				public boolean checkCondition(String arg)
				{
					if (arg.equals(m_OurPosition_MayBe_OUT_OF_DATE))
						return true;
					else
						return false;
				}

			}, null);

		return p_ComputeTrailFrom_SpanningTree(nodeTo, augmentedMap);
	}