Find the Shortest Path through Breadth First Search in Spring Boot

📖 Information

• Breadth-First Search algorithm is a graph traversing technique, where you select a random initial node (source or root node) and start traversing the graph layer-wise in such a way that all the nodes and their respective children nodes are visited and explored
• Here is the explanation of the project
  • Find the shortest path between two countries cca3 code with respect to the resource defined below.
  • Here is the resource link : https://mledoze.github.io/countries

Used Dependencies

• Core
  • Spring
    • Spring Boot
    • Spring Web
• Lombok
• Feign
• Docker

🔨 Run the App

Maven

1 ) Download your project from this link shown below

    git clone https://github.com/Rapter1990/findshortestpathbfs

2 ) Go to the project's home directory shown below

    cd findshortestpathbfs

3 ) Create a jar file though this command shown below

    mvn clean install

4 ) Run the project though this command shown below

    mvn spring-boot:run

Docker

1 ) Build the image through Docker

    docker build -t findshortestpathbfs .

2 ) Run the command

    docker run -p8080:8080 findshortestpathbfs

Explore Rest APIs

Method	Url	Description	Valid Request Body	Valid Request Params	Valid Request Params and Body	No Request or Params
GET	route	Find the shortest path	Info

Valid Request Body

Find the shortest path

    http://localhost:8080/route
    
    {
       "from": the cca3 code of the country
       "to": the cca3 code of the country
    }

Screenshots

Click here to show the screenshots of project

Figure 1