Scribd
Upload
23 views2 pages

Data Structure

Dijkstra's Algorithm finds the shortest path between a starting node and all other nodes in a graph, while the travelling salesman problem involves finding the shortest route for a salesman to visit each city on a list exactly once and return to the origin point.

Uploaded by

Deepak Chakrasali
Copyright
© © All Rights Reserved
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
Download as pptx, pdf, or txt
23 views2 pages

Data Structure

Dijkstra's Algorithm finds the shortest path between a starting node and all other nodes in a graph, while the travelling salesman problem involves finding the shortest route for a salesman to visit each city on a list exactly once and return to the origin point.

Uploaded by

Deepak Chakrasali
Copyright
© © All Rights Reserved
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
Download as pptx, pdf, or txt
Download as pptx, pdf, or txt
You are on page 1/ 2

Introduction

Dijkstra's Algorithm is one of the most


popular algorithms in computer science.
It is also popular in operations research.It
is an iterative algorithm that provides us
with the shortest path from one particular
starting node to all other nodes in the
graph.

Travelling salesman
problem

Given a list of cities with the distance


between each pair of cities the salesman
has to deliver the products to each city
exactly once and return back to his origin
point.

You might also like