undirected graph

This term is a technical specification used primarily in discrete mathematics, computer science, and network analysis. It describes a structure where the connection between two nodes is mutual, implying that if node A is connected to node B, then node B is automatically connected to node A. This contrasts with a directed graph (digraph), where edges have a specific direction, similar to a one-way street.

In practical application, this is used to model symmetric relationships, such as a friendship on a social network where both parties must be connected, or a physical cable connecting two computers. It is a formal term and is rarely used outside of academic or technical documentation.