m_First = m_Last = new NeighborNode(distance, instance); } else { NeighborNode current = m_First; if (distance < m_First.m_Distance) {// Insert at head m_First = new NeighborNode(distance, instance, m_First); } else { // Insert further down the list for (; (current.m_Next != null) current.m_Next = new NeighborNode(distance, instance, current.m_Next); if (current.equals(m_Last)) { m_Last = current.m_Next;
m_First = m_Last = new NeighborNode(distance, instance); } else { NeighborNode current = m_First; if (distance < m_First.m_Distance) {// Insert at head m_First = new NeighborNode(distance, instance, m_First); } else { // Insert further down the list for (; (current.m_Next != null) current.m_Next = new NeighborNode(distance, instance, current.m_Next); if (current.equals(m_Last)) { m_Last = current.m_Next;