[go: up one dir, main page]
Scribd
Upload
48 views3 pages

AI Lab Program 10

The document describes an assignment to write a program to solve the Travelling Salesman Problem using a graph with 4 vertices and calculate the minimum cost path. It includes code to implement the travelling salesman problem using dynamic programming and functions for the next permutation to try all permutations of paths. The output displays the test graph and minimum cost of 80 for the travelling salesman to visit all vertices starting from vertex 0.

Uploaded by

Vikas Bhardwaj
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
48 views3 pages

AI Lab Program 10

The document describes an assignment to write a program to solve the Travelling Salesman Problem using a graph with 4 vertices and calculate the minimum cost path. It includes code to implement the travelling salesman problem using dynamic programming and functions for the next permutation to try all permutations of paths. The output displays the test graph and minimum cost of 80 for the travelling salesman to visit all vertices starting from vertex 0.

Uploaded by

Vikas Bhardwaj
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 3

Assignment

VIKAS BHARDWAJ (17SCSE101588)

AIM – Write a program to implement Travelling Salesman Problem

Code –

from sys import maxsize

V=4

def travellingSalesmanProblem(graph, s):

vertex = []

for i in range(V):

if i != s:

vertex.append(i)

min_path = maxsize

while True:

current_pathweight = 0

k=s

for i in range(len(vertex)):

current_pathweight += graph[k][vertex[i]]

k = vertex[i]

current_pathweight += graph[k][s]

min_path = min(min_path, current_pathweight)

if not next_permutation(vertex):

break

return min_path

def next_permutation(L):
n = len(L)

i=n-2

while i >= 0 and L[i] >= L[i + 1]:

i -= 1

if i == -1:

return False

j=i+1

while j < n and L[j] > L[i]:

j += 1

j -= 1

L[i], L[j] = L[j], L[i]

left = i + 1

right = n - 1

while left < right:

L[left], L[right] = L[right], L[left]

left += 1

right -= 1

return True

if __name__ == "__main__":

graph = [[0, 10, 15, 20], [10, 0, 35, 25],

[15, 35, 0, 30], [20, 25, 30, 0]]

s=0
print("the graph is : ", graph)

print("The minimum cost is: ", end=" ")

print(travellingSalesmanProblem(graph, s))

Output –

The graph is: [[0, 10, 15, 20], [10, 0, 35, 25], [15, 35, 0, 30], [20, 25, 30, 0]]

The minimum cost is: 80

You might also like