- The evolving graph model was developed to capture the information on the topology of dynamic networks in a compact and efficient manner . It is known that to find the size of the maximum strongly connected component in evolving graphs is NP-hard . In this paper we study the strongly connected component in evolving graphs with geometric properties. We show that SCC is still NP-hard in the case the nodes are placed on a grid and two points are connected if the Euclidean distance is equal or less than 2. On the other hand we show that if the underlying graph is tree this problem can be solved in polynomial time.