/** * Try to add the first paths to the specified vertex. These paths reached the specified vertex * and ended with the specified edge. A new intermediary path is stored in the paths list of the * specified vertex provided that the path can be extended to the end-vertex. * * @param vertex vertex reached by a path. * @param edge edge reaching the vertex. */ private boolean tryToAddFirstPaths(V vertex, E edge) { // the vertex has not been reached yet RankingPathElementList<V, E> data = createSeenData(vertex, edge); if (!data.isEmpty()) { this.seenDataContainer.put(vertex, data); return true; } return false; }