In the past decade, the study of the dynamics of complex networks has been a focus of research. In particular, the controllability of complex networks based on the nodal dynamics has received strong attention. As a result, significant theories have been formulated in network control. Target control theory is one of the most important results among these theories. This theory addresses how to select as few input nodes as possible to control the chosen target nodes in a nodal linear dynamic system. However, the research on how to control the target edges in switchboard dynamics, which is a dynamical process defined on the edges, has been lacking. This shortcoming has motivated us to give an effective control scheme for the target edges. Here, we propose the k-travel algorithm to approximately calculate the minimum number of driven edges and driver nodes for a directed tree-like network. For general cases, we put forward a greedy algorithm TEC to approximately calculate the minimum number of driven edges and driver nodes. Analytic calculations show that networks with large assortativity coefficient as well as small average shortest path are efficient in random target edge control, and networks with small clustering coefficient are efficient in local target edge control.