Package org.graph4j.ordering
package org.graph4j.ordering
Algorithms that produce various orderings of the vertices of a graph.
-
ClassDescriptionAn acyclic orientation of an undirected graph is an assignment of a direction to each edge (an orientation) that does not form any directed cycle and therefore makes it into a directed acyclic graph.Computes the vertex ordering from the end to the beginning.Computes an ordering of a directed graph vertices such that for every directed edge (u,v) from vertex u to vertex v, u comes before v in the ordering.Contains static methods that create various vertex orderings.