Types of Graph
Complete Graph
A complete graph is a graph in which every pair of vertices is connected by an edge. They are named as K1, K2, K3, … Kn where n is the number of vertices.
The number of edges is n(n-1)/2
References
#computer_science #search #function #structure #boot_dev #hash #graph #programming #data #memory