A **bidirected graph** (also known as a bidirectional graph) is a type of graph in which edges have a direction that allows for travel in both directions between any two connected vertices. In other words, if there is an edge from vertex \( A \) to vertex \( B \), it can also be traversed from vertex \( B \) back to vertex \( A \).
New to topics? Read the docs here!