Connected graph
Concept history
A revision trail for this concept page.
Revision 3977
9/6/2026, 11:01:48 AM · T.W
Added exercise "Un nombre minimal de sommets pour les graphes connexes."
linked exercisesNoneUn nombre minimal de sommets pour les graphes connexes.
Revision 495
7/20/2026, 3:20:39 PM · Ancient Tree
Concept edited
Compare with revision 4932 changed lines
1
A [[graph|graph]] is said to be connected if and only if for any pair of vertices of this graph, there exists a sequence of adjacent edges that connect the first vertex to the second.2
3
If the graph is directed, on adds the condition that this path also need to be directed.3
If the graph is [[Directed graph|directed]], one adds the condition that this path also need to be directed.Revision 493
7/20/2026, 3:18:49 PM · Ancient Tree
Concept edited
Compare with revision 4922 changed lines
1
A [[graph|graph]] is said connected if and only if for any pair of vertices of this graph, there exists a sequence of adjacent edges that connect the first vertex to the second.1
A [[graph|graph]] is said to be connected if and only if for any pair of vertices of this graph, there exists a sequence of adjacent edges that connect the first vertex to the second.2
3
If the graph is directed, on adds the condition that this path also need to be directed.Revision 492
7/20/2026, 3:17:41 PM · Ancient Tree
Concept edited
This older revision predates detailed metadata tracking.
Revision 486
7/20/2026, 7:11:04 AM · Sequoia
Concept created
A [[graph|graph]] is said connected if and only if for any pair of vertices of this graph, there exists a sequence of adjacent edges that connect the first vertex to the second. If the graph is directed, on adds the condition that this path also need to be directed.