diff --git a/graph-data-science/graph-search-algorithms/graph-search-algorithms-key-topic.adoc b/graph-data-science/graph-search-algorithms/graph-search-algorithms-key-topic.adoc
index f3dd3cf9..52e127c8 100644
--- a/graph-data-science/graph-search-algorithms/graph-search-algorithms-key-topic.adoc
+++ b/graph-data-science/graph-search-algorithms/graph-search-algorithms-key-topic.adoc
@@ -32,6 +32,10 @@ Graph search (or graph traversal) algorithms explore a graph for general discove
 They will try to visit as much of the graph as they can reach, but there is no expectation that the paths they explore are computationally optimal.
 Graph search algorithms are usually used as a core component of other algorithms.
 
+++++
+<iframe width="560" height="315" src="https://www.youtube.com/embed/HAEv7mntGeA" frameborder="0" allow="accelerometer; autoplay; encrypted-media; gyroscope; picture-in-picture" allowfullscreen></iframe>
+++++
+
 The Neo4j https://neo4j.com/graph-data-science-library[Graph Data Science Library^] supports both of the graph search algorithms.
 
 [#breadth-first-search]