Scribd Logo
Upload

Welcome to Scribd!

  • 16 views

    Daa Travel Salesman Problem Using Brute Force Method

    Uploaded by

    venkatachai123
    The document describes two algorithms for solving the Traveling Salesman Problem (TSP): 1. A brute force method that iterates through all possible paths and tracks the minimum cost path found. 2. A dynamic programming approach that uses memoization to store results of subproblems and avoid recomputing paths, iterating through nodes with a bitmask to track visited nodes. Both algorithms take as input an adjacency matrix representing distances between nodes and output the minimum cost path.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd

    Daa Travel Salesman Problem Using Brute Force Method

    Uploaded by

    venkatachai123
    16 views7 pages
    The document describes two algorithms for solving the Traveling Salesman Problem (TSP): 1. A brute force method that iterates through all possible paths and tracks the minimum cost path found. 2. A dynamic programming approach that uses memoization to store results of subproblems and avoid recomputing paths, iterating through nodes with a bitmask to track visited nodes. Both algorithms take as input an adjacency matrix representing distances between nodes and output the minimum cost path.

    Original Description:

    design analsyis algorithm

    Original Title

    daa travel salesman problem using brute force method

    Copyright

    © © All Rights Reserved

    Available Formats

    PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    The document describes two algorithms for solving the Traveling Salesman Problem (TSP): 1. A brute force method that iterates through all possible paths and tracks the minimum cost path found. 2. A dynamic programming approach that uses memoization to store results of subproblems and avoid recomputing paths, iterating through nodes with a bitmask to track visited nodes. Both algorithms take as input an adjacency matrix representing distances between nodes and output the minimum cost path.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Download as pdf or txt
    16 views7 pages

    Daa Travel Salesman Problem Using Brute Force Method

    Uploaded by

    venkatachai123
    The document describes two algorithms for solving the Traveling Salesman Problem (TSP): 1. A brute force method that iterates through all possible paths and tracks the minimum cost path found. 2. A dynamic programming approach that uses memoization to store results of subproblems and avoid recomputing paths, iterating through nodes with a bitmask to track visited nodes. Both algorithms take as input an adjacency matrix representing distances between nodes and output the minimum cost path.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Download as pdf or txt
    of 7

    DAA ASSIGNMENT -4

    21BCE9283 Y.V.K.CHAITANYA
    Travel and Salesman Problem
    a)Bruteforce Method
    CODE:
    import java.util.*;
    public class TSPBruteForce {
    static int[][] graph;
    static int numNodes;
    static boolean[] visited;
    static int minCost = Integer.MAX_VALUE;
    static ArrayList<Integer> minPath;
    static void tsp(int currentNode, int cost, int count, ArrayList<Integer> path) {
    if (count == numNodes && graph[currentNode][0] != 0) {
    cost += graph[currentNode][0];
    if (cost < minCost) {
    minCost = cost;
    minPath = new ArrayList<>(path);
    }
    return;
    }
    for (int i = 0; i < numNodes; i++) {
    if (graph[currentNode][i] != 0 && !visited[i]) {
    visited[i] = true;
    path.add(i);
    tsp(i, cost + graph[currentNode][i], count + 1, path);
    visited[i] = false;
    path.remove(path.size() - 1);
    }
    }
    }
    public static void main(String[] args) {
    Scanner scanner = new Scanner(System.in);
    System.out.println("Enter the number of nodes:");
    numNodes = scanner.nextInt();
    graph = new int[numNodes][numNodes];
    System.out.println("Enter the adjacency matrix:");
    for (int i = 0; i < numNodes; i++) {
    for (int j = 0; j < numNodes; j++) {
    graph[i][j] = scanner.nextInt();
    }
    }
    visited = new boolean[numNodes];
    Arrays.fill(visited, false);
    visited[0] = true;
    ArrayList<Integer> path = new ArrayList<>();
    path.add(0);
    tsp(0, 0, 1, path);
    System.out.println("Minimum Cost: " + minCost);
    System.out.println("Path: " + minPath);
    scanner.close();
    }
    }
    OUTPUT:

    B)Dynamic Programming
    CODE:
    import java.util.*;
    public class TSPDynamicProgramming {
    static int[][] graph;
    static int numNodes;
    static int[][] memo;
    static int tsp(int start, int mask) {
    if (mask == (1 << numNodes) - 1) {
    return graph[start][0];
    }
    if (memo[start][mask] != -1) {
    return memo[start][mask];
    }
    int minCost = Integer.MAX_VALUE;
    for (int next = 0; next < numNodes; next++) {
    if ((mask & (1 << next)) == 0 && graph[start][next] != 0) {
    int newCost = graph[start][next] + tsp(next, mask | (1 << next));
    minCost = Math.min(minCost, newCost);
    }
    }
    return memo[start][mask] = minCost;
    }

    public static void main(String[] args) {


    Scanner scanner = new Scanner(System.in);
    System.out.println("Enter the number of nodes:");
    numNodes = scanner.nextInt();
    graph = new int[numNodes][numNodes];
    System.out.println("Enter the adjacency matrix:");
    for (int i = 0; i < numNodes; i++) {
    for (int j = 0; j < numNodes; j++) {
    graph[i][j] = scanner.nextInt();
    }
    }
    memo = new int[numNodes][1 << numNodes];
    for (int[] row : memo) {
    Arrays.fill(row, -1);
    }
    int minCost = tsp(0, 1);
    System.out.println("Minimum Cost: " + minCost);
    scanner.close();
    }
    }
    OUTPUT:

    You might also like

    pFad - Phonifier reborn

    Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

    Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


    Alternative Proxies:

    Alternative Proxy

    pFad Proxy

    pFad v3 Proxy

    pFad v4 Proxy