Remove apha note

Author: IoannisPanagiotas

doc/modules/ROOT/pages/algorithms/strongly-connected-components.adoc

@@ -8,10 +8,6 @@ The Strongly Connected Components (SCC) algorithm finds maximal sets of connecte
 A set is considered a strongly connected component if there is a directed path between each pair of nodes within the set.
 It is often used early in a graph analysis process to help us get an idea of how our graph is structured.
 
-
-include::partial$/operations-reference/alpha-note.adoc[]
-
-
 :directed:
 :undirected:
 include::partial$/algorithms/shared/algorithm-traits.adoc[]