olemus
graaf, mille iga kaht tippu \(u\) ja \(w\) ühendab mingi tippude ahel
\(u=v_1, v_2, \ldots, v_m=w\),
kus tipud \(v_i\) ja \(v_{i+1}\) on kaarega ühendatud
= a graph that has a path between every pair of vertices
https://gateoverflow.in/?qa=blob&qa_blobid=12366043276973393181

ülevaateid
https://www.quora.com/What-is-the-difference-between-a-complete-graph-and-a-connected-graph
https://study.com/academy/lesson/connected-graph-vs-complete-graph.html
https://en.wikipedia.org/wiki/Connectivity_(graph_theory)#Connected_vertices_and_graphs
https://mathworld.wolfram.com/ConnectedGraph.html
https://www.csd.uoc.gr/~hy583/papers/ch17.pdf

vt ka
- sidusus