Nouns

(n)undirected graphIn mathematics, a graph in which edges have no orientation.“In mathematics, and more specifically in graph theory, a tree is an undirected graph in which any two vertices are connected by exactly one path.”