The fundamentals of edge metric dimension are examined in this study, along with constraints for various graph types and algorithms for quickly computing edge-resolving sets. The EMD of a graph is an uniqueness of the metric dimension, which originated from the graph’s emphasis on vertex resolving sets. In this context, an edge-resolving set is a collection of vertices in which each edge of the graph can be particularly recognized by its distance from the vertices. In fields where edges must be found, such as network topology, robotic mobility, chemistry and combinatorial optimization, it is crucial.