Path planning is essential for many tasks, such as robot navigation and autonomous driving. When encountering a complex and large environment, finding the path costs a lot of resources. In this work, we introduce an efficient method with a general planning network. Instead of routing on the original map, we divide the process into two stages: global and detail routing. For the global routing, we resize the map and use eight maps to represent the obstacle distributions over eight directions. For detail routing, we concentrate on the local map corresponding to every point on the global path. To increase the success rate, we add re-routing and re-selection mechanisms. We evaluate our method by the training time, the execution time, and the accuracy. Furthermore, we show the flexibility of our network on action selection.