Algorithms Analysis Practice Test 2026 - Free Algorithms Practice Questions and Study Guide

A graph where edges do not have directional indications is called an undirected graph, not a uni-directed graph. In undirected graphs, the edges simply connect two vertices, indicating a bidirectional relationship. This means that there is no distinction or directionality to the connections; for example, if vertex A is connected to vertex B, then the relationship is mutual – one can traverse from A to B and vice versa without any directional constraint.

In contrast, a uni-directed graph typically refers to a directed graph (or digraph) where edges have a specific direction, indicating a one-way relationship between vertices. Hence, the statement about a graph with no directional indications being referred to as a uni-directed graph is false.