In the realm of linking networks to real world, connectivity (strength connectedness) plays a crucial role. this article, we introduce three types vertices based on indegree and outdegree directed rough fuzzy (DRFNs). We also define concept strength-reducing sets ( $$\mathcal {SRS}s$$ ) DRF-vertices, DRF-edges, important related results using strongest path in graphs (DRFGs). generalize idea Me...

The directed graph reachability problem takes as input an n-vertex directed graph G = (V,E), and two distinguished vertices s and t. The problem is to determine whether there exists a path from s to t in G. This is a canonical complete problem for class NL. Asano et al. proposed an Õ( √ n) space and polynomial time algorithm for the directed grid and planar graph reachability problem. The main ...