👉 Undirected is a mathematical concept in graph theory that refers to a set of vertices (nodes) which are not connected by any directed edges. Undirected graphs can be thought of as graphs with no directionality, meaning that there is no direction between two nodes. In the context of undirected graphs, we typically refer to these as "graphs" rather than "digraphs". A digraph, on the other hand, is a type of graph in which each edge has both directions. For
