sundirected
An undirected graph, sometimes referred to as a sundirected graph, is a graph in which edges have no orientation. Each edge connects two vertices without any order, so if a is adjacent to b, then b is also adjacent to a. Edges can be simple (no repeats or loops) or multiedges, and a loop contributes twice to the degree of its vertex.
A graph G is typically denoted as G = (V, E), where V is a set of vertices
Key concepts include connectivity, where a graph is connected if there is a path between every pair
Algorithms for undirected graphs include depth-first search and breadth-first search for traversal, as well as algorithms
Applications of undirected graphs appear in modeling mutual relationships (for example, friendship networks), road maps where