def nearest_neighbor_tsp(distances):

    n = len(distances)

    visited = [False] * n

    route = [0]

    visited[0] = True

    total_distance = 0

​

    for _ in range(1, n):

        last = route[-1]

        nearest = None

        min_dist = float('inf')

        for i in range(n):

            if not visited[i] and distances[last][i] < min_dist:

                min_dist = distances[last][i]

                nearest = i

        route.append(nearest)

        visited[nearest] = True

        total_distance += min_dist

​

    total_distance += distances[route[-1]][0]

    route.append(0)

    return route, total_distance

​

distances = [

    [0, 2, 2, 5, 9, 3],

    [2, 0, 4, 6, 7, 8],

    [2, 4, 0, 8, 6, 3],

    [5, 6, 8, 0, 4, 9],

    [9, 7, 6, 4, 0, 10],

    [3, 8, 3, 9, 10, 0]

]

​

route, total_distance = nearest_neighbor_tsp(distances)

print("Route:", route)

print("Total distance:", total_distance)

​

#Python

#include <stdio.h>

#include <stdbool.h>

#include <limits.h>

​

#define N 6

​

void nearestNeighborTSP(int distances[N][N], int route[N + 2], int *totalDistance) {

    bool visited[N] = {false};

    int count = 1;

    route[1] = 0; // Starting from city 0

    visited[0] = true;

    *totalDistance = 0;

​

    for (int step = 1; step < N; step++) {

        int last = route[count];

        int nearest = -1;

        int minDist = INT_MAX;

        for (int i = 0; i < N; i++) {

            if (!visited[i] && distances[last][i] < minDist) {

                minDist = distances[last][i];

                nearest = i;

            }

        }

        route[++count] = nearest;

        visited[nearest] = true;

        *totalDistance += minDist;

    }

​

    *totalDistance += distances[route[count]][0]; // Return to start

    route[++count] = 0; // Close the loop

    route[0] = count - 1; // Store the count of vertices visited

}

​

int main() {

    int distances[N][N] = {

        {0, 2, 2, 5, 9, 3},

        {2, 0, 4, 6, 7, 8},

        {2, 4, 0, 8, 6, 3},

        {5, 6, 8, 0, 4, 9},

        {9, 7, 6, 4, 0, 10},

        {3, 8, 3, 9, 10, 0}

    };

    int route[N + 2]; // +1 for total count, +1 for total distance

    int totalDistance;

public class Main {

    public static void main(String[] args) {

        int[][] distances = {

            {0, 2, 2, 5, 9, 3},

            {2, 0, 4, 6, 7, 8},

            {2, 4, 0, 8, 6, 3},

            {5, 6, 8, 0, 4, 9},

            {9, 7, 6, 4, 0, 10},

            {3, 8, 3, 9, 10, 0}

        };

​

        int[] result = nearestNeighborTSP(distances);

        System.out.print("Route: ");

        for (int i = 0; i < result[0]; i++) {

            System.out.print(result[i + 1] + " ");

        }

        System.out.println("0");

        System.out.println("Total Distance: " + result[result[0] + 1]);

    }

​

    public static int[] nearestNeighborTSP(int[][] distances) {

        int n = distances.length;

        boolean[] visited = new boolean[n];

        int[] route = new int[n + 2]; // +2 for the count and total distance

        route[1] = 0; // Start from 0

        visited[0] = true;

        int totalDistance = 0;

        int count = 1;

​

        for (int step = 1; step < n; step++) {

            int last = route[count];

            int nearest = -1;

            int minDist = Integer.MAX_VALUE;

            for (int i = 0; i < n; i++) {

                if (!visited[i] && distances[last][i] < minDist) {

                    minDist = distances[last][i];

                    nearest = i;

                }

            }

            route[++count] = nearest;

            visited[nearest] = true;

            totalDistance += minDist;

        }

​