The DFS algorithm was based on two components: depth-first search and dynamic clique maintenance to scan and eliminate nodes and identify new cliques, respectively.