invalids.toArray(new AtomicVertex[0])));
} else
{
for (int j = 0; j < _finalConditions.length; j++)
{
PathsFinder finder =
new PathsFinder(startCondition, _finalConditions[j], _renderer
.onlyShortestPaths(), directPathsOnly);
result.add(new DependencyResult(startSet, _finalSets[j], toString(i, j), finder
.findPaths(graph)));
}
}
}
return result;