public void dfsSorted(int u, int[][] graf, Vertex[] vertexes, LinkedList<Integer> sorted) {
		if (vertexes[u].was) {
			inf = true;
			return;
		}
		vertexes[u].was = true;
		sorted.add(u);

		for (int i = 0; i < vertexes[u].antiEdge.size(); i++) {
			dfsSorted(i, graf, vertexes, sorted);
		}