👉 An ortive is a type of graph that represents an undirected graph, where each vertex in the graph has no edges pointing to it. In other words, a graph with no loops or multiple edges between vertices can be represented as an ortive graph. The vertices of an ortive graph are labeled by their labels and connected by directed edges if they have a common label.
