Bidirected graph

Graph whose edges are given independent directions at both ends

In the mathematical domain of graph theory, a bidirected graph is a graph in which each edge is given an independent orientation at each end. Thus, there are three kinds of bidirected edges: those where the arrows point outward, towards the vertices, at both ends; those where both arrows point inward, away from the vertices; and those in which one arrow points away from its vertex and towards the opposite end, while the other arrow points in the same direction as the first, away from the opposite end and towards its own vertex.

This keyword could refer to multiple things. Here are some suggestions: