Consider G be a directed graph whose vertex set is a set numbers from 2 to 120. There is an edge from vertex a to vertex b if b = K× a. Where K is any natural number. Then the number of connected components are_________.

# Graph..theory undirected

if we talk of strongly connected graph as given in https://www.geeksforgeeks.org/strongly-connected-components/, then each vertex will be a component of its own because there will be no back edges, hence there will be 119 components