travelling salesman izle

• Yeni bildirimin yok!
• Platformlar
• Vizyondaki Filmler
• Tüm Filmler
• Tüm Diziler
• Tüm Sanatçılar
• TV Dizileri

Travelling Salesman

• İzlediklerimden Çıkar İzlediklerime Ekle
• Favorilerime Ekle Favorilerimden Çıkar
• Listeme Ekle

Travelling Salesman Filmi Oyuncuları »

Bu filmleri de beğenebilirsiniz

Son Eklenen Listeler

Popüler Listeler

Size daha iyi hizmet sunmak, içerik ve reklamları kişiselleştirmek için çerezler aracılığı ile internet tarama verileri topluyoruz.

Travelling Salesman (2012) Stream and Watch Online

Watch 'Travelling Salesman' Online

Looking to feast your eyes on ' Travelling Salesman ' in the comfort of your own home? Tracking down a streaming service to buy, rent, download, or view the Timothy Lanzone-directed movie via subscription can be a challenge, so we here at Moviefone want to do the work for you. Read on for a listing of streaming and cable services - including rental, purchase, and subscription choices - along with the availability of 'Travelling Salesman' on each platform when they are available. Now, before we get into the nitty-gritty of how you can watch 'Travelling Salesman' right now, here are some details about the Fretboard Pictures mystery flick. Released June 16th, 2012, 'Travelling Salesman' stars Danny Barclay , Eric Bloom , Malek Houlihan , Matt Lagan The movie has a runtime of about 1 hr 20 min, and received a user score of 57 (out of 100) on TMDb, which compiled reviews from 31 knowledgeable users. Curious to know what the movie's about? Here's the plot: "Four mathematicians are gathered and meet with a top official of the United States Department of Defense After some discussion the group agrees that they must be wary with whom to trust and control their solution The official offers them a reward of 10 million in exchange for their portion of the algorithm swaying them by attempting to address their concerns Only one of the four speaks out against the sale and in doing so is forced to reveal a dark truth about his portion of the solution Before they sign a license to the government however they wrestle with the ethical consequences of their discovery Wikipedia" 'Travelling Salesman' is currently available to rent, purchase, or stream via subscription on Apple iTunes, Google Play Movies, Amazon Video, and YouTube .

'Travelling Salesman' Release Dates

Popular mystery movies.

Movie Reviews

Follow Moviefone

Movie trailers.

Travelling Salesman (2012)

Streaming in:

80min - English

Watch similar movies on Apple TV+ for free

7 Days Free

Then $9.99 / month

We checked for updates on 247 streaming services on April 12, 2024 at 5:32:12 AM. Something wrong? Let us know!

Travelling Salesman streaming: where to watch online?

You can buy "Travelling Salesman" on Apple TV, Amazon Video, Google Play Movies, YouTube as download or rent it on Apple TV, Amazon Video, Google Play Movies, YouTube online.

Four mathematicians are gathered and meet with a top official of the United States Department of Defense. After some discussion, the group agrees that they must be wary with whom to trust and control their solution. The official offers them a reward of $10 million in exchange for their portion of the algorithm, swaying them by attempting to address their concerns. Only one of the four speaks out against the sale, and in doing so is forced to reveal a dark truth about his portion of the solution. Before they sign a license to the government, however, they wrestle with the ethical consequences of their discovery. -- Wikipedia

Videos: Trailers, Teasers, Featurettes

Production country

People who liked travelling salesman also liked.

Popular movies coming soon

Upcoming Drama movies

Similar Movies you can watch for free

Now Available

"The themes and issues it addresses have never been more relevant ... Travelling Salesman is an essential watch."

" Travelling Salesman ’s mathematicians are all too aware of what their work will do to the world, and watching them argue how to handle the consequences offers a thriller far more cerebral than most."

"Simply unbelievably excellent filmmaking. This is a film to seek out."

"A trip to see this movie might become an obligatory part of all math degrees."

Worldwide Screening Events

New York. Philadelphia. London. Cambridge. Phoenix. Washington D.C. Glasgow. Tel Aviv. Seoul. Hamburg. Hertfordshire. San Francisco. Athens. College Station. Milwaukee. Nanyang. Edinburgh. Ann Arbor.

Winner Best Feature Film

Silicon valley film festival 2012, picture summary.

Travelling Salesman is an intellectual thriller about four mathematicians hired by the U.S. government to solve the most elusive problem in computer science history — P vs. NP. The four have jointly created a "system" which could be the next major advancement for our civilization or destroy the fabric of humanity.

The solution's immediate application would be for theoretical computer science. However, its application would soon extend to countless other disciplines. For example, by utilizing the solution to P vs. NP, a hacker could crack advanced encryption codes within seconds—a task that now takes weeks, months, or even years. He could break into La Guardia's air traffic control or China's communication grid. But the mathematical algorithm would also serve as the basis for accelerated biological research, curing diseases such as AIDS and cancer.

We begin the film with the four at a secret location waiting to meet with a high-ranking official of the United States Department of Defense. The group discusses the global implications of their solution, and they agree that they must be extremely careful with who they allow to control their discovery.

The silver-tongued DoD agent soon arrives and presents them each with an offer of 10 million dollars in exchange for their portion of the algorithmic solution. He attempts to deftly address their concerns and sway the opinions of the four.

In the end, only one mathematician speaks out against selling the solution. In pleading his case, he is forced to reveal the dark truth about his portion of the algorithm. As the mathematicians are about to sign documents that will give the U.S. government sole and private ownership of their solution, they wrestle with the moral dilemma of how this volatile discovery will be used. The math is real. The implications are real.

The Math Behind The Film

The P vs. NP problem is the most notorious unsolved problem in computer science. First introduced in 1971, it asks whether one class of problems (NP) is more difficult than another class (P).

Mathematicians group problems into classes based on how long they take to be solved and verified. " NP " is the class of problems whose answer can be verified in a reasonable amount of time. Some NP problems can also be solved quickly. Those problems are said to be in " P ", which stands for polynomial time. However, there are other problems in NP which have never been solved in polynomial time.

The question is, is it possible to solve all NP problems as quickly as P problems? To date, no one knows for sure. Some NP questions seem harder than P questions, but they may not be.

Currently, many NP problems take a long time to solve. As such, certain problems like logistics scheduling and protein structure prediction are very difficult. Likewise, many cryptosystems, which are used to secure the world's data, rely on the assumption that they cannot be solved in polynomial time.

If someone were to show that NP problems were not difficult—that P and NP problems were the same—it would would have significant practical consequences. Advances in bioinformatics and theoretical chemistry could be made. Much of modern cryptography would be rendered inert. Financial systems would be exposed, leaving the entire Western economy vulnerable.

Proving that P = NP would have enormous ramifications that would be equally enlightening, devastating, and valuable...

"Mathematical puzzles don't often get to star in feature films, but P vs NP is the subject of an upcoming thriller"

"A movie that features science and technology is always welcome, but is it not often we have one that focuses on computer science. Travelling Salesman is just such a rare movie."

"We all know that the P=NP question is truly fascinating, but now it is about to be released as a movie."

"I speak with Timothy about where he got the idea for the movie, how he made sure that the mathematics was correct, and why science movies just may be the new comic book movies."

"At last someone is taking the position that P = NP is a possibility seriously. If nothing else, the film's brain trust realize that being equal is the cool direction, the direction with the most excitement, the most worthy of a major motion picture."

"Travelling Salesman is an unusual movie: despite almost every character being a mathematician there's not a mad person in sight."

Production Stills

Travelling Salesman

Cast & crew.

Number Four

Marc J. Raymond

Tyler Seiple

Danny Barclay

Information

© 2013 Arts and Magic Films LLC.

Accessibility

Copyright © 2024 Apple Inc. All rights reserved.

Internet Service Terms Apple TV & Privacy Cookie Policy Support

Watch Travelling Salesman

• 1 hr 20 min
• 5.8   (1,354)

Travelling Salesman is a 2012 sci-fi thriller film that explores the concept of P vs NP, a complex mathematical problem that has baffled computer scientists for decades. The movie stars Danny Barclay as a brilliant mathematician named "Gregory," who sets out to solve this enigma with the help of his colleagues: Arthur, played by Eric Bloom, and Reginald, portrayed by David John Cole.

The film opens with Gregory receiving an invitation to a secret meeting hosted by a billionaire software magnate named Arthur. Upon arriving at the meeting, Gregory realizes that he has been joined by other mathematicians who have been working on the P vs NP problem independently for years. After some heated debate, the group is offered an opportunity of a lifetime by Arthur, who promises to solve the problem and award each of them $1 million dollars.

The catch? The problem must be solved within 24 hours, and they have to solve it together. The mathematicians are provided with a black box that is said to contain the solution to the P vs NP problem, but they are only allowed to communicate with each other inside the box and must keep a record of their conversations for transparency. The goal is to reach a unanimous solution to the problem, with each member agreeing to the outcome.

As the group dives deeper into the problem, tensions rise, and the mathematicians begin to question not only each other's abilities but also their own ethical compasses. The group is forced to confront some of the fundamental questions of mathematics, computing and their place in the world.

One of the most noteworthy aspects of the film is its strong portrayal of how deeply personal and emotional mathematics can be. Throughout the movie, each character's psyche is gradually revealed as they struggle with their personal demons, haunted by the threat that their work might be for naught or even misused.

Travelling Salesman does an excellent job of exploring the intricacies of the P vs NP problem, which is notoriously difficult to explain to general audiences. The film tackles this problem competently - it takes the difficult matter seriously, and attempts to convey concepts such as algorithmic complexity and the ramifications of the problem, all while developing the film's narrative.

Another highlight of the film is the ambiguity that surrounds the box. While it is initially portrayed as a magical device that provides the answer to the problem, the mathematicians grow more cautious as they begin to wonder what the box is truly capable of. Is it really just a solution to P vs NP, or is it something more sinister, a device that could break encryption, infiltrate security systems or even threaten national security?

Overall, Travelling Salesman is a highly interesting and engaging thriller that manages to keep the viewers on the edge of their seats while also exploring complex philosophical and mathematical ideas. As a viewer, one is left with lots to consider, not just about the P vs. NP problem but about the competing passions of intellectual pursuit, personal ambition, and the moral responsibility in the world of science.

Travelling Salesman is a 2012 drama with a runtime of 1 hour and 20 minutes. It has received moderate reviews from critics and viewers, who have given it an IMDb score of 5.8.

• Genres Drama Mystery
• Cast Danny Barclay Eric Bloom David John Cole
• Director Timothy Lanzone
• Release Date 2012
• Runtime 1 hr 20 min
• Language English
• IMDB Rating 5.8   (1,354)

Travelling Salesman

About this movie

Ratings and reviews.

• Flag inappropriate

Rate this movie

• Movies & TV Shows
• Most Popular
• Leaving Soon
• Documentary
• Browse Channels

Featured Channels

• Always Funny
• History & Science
• Sci-Fi & Action
• Chills & Thrills
• Nature & Travel
• Black Entertainment
• Kids & Family
• International
• Gaming & Anime

Travelling Salesman

Watch on these services.

Take Plex everywhere

To revisit this article, visit My Profile, then View saved stories .

• Backchannel
• Newsletters
• WIRED Insider
• WIRED Consulting

Duncan Geere

Film explores moral and political repercussions of proving P equals NP

What would happen if one government learnt how to bypass the world's encryption systems? That's the all-too-timely question asked by Travelling Salesman , a movie that hands the starring role to a mathematical puzzle.

Its title refers to the "travelling salesman problem" -- given a list of cities and the distances between them all, what's the most efficient way that a salesman can visit them all and return home?

It's easy to check whether a given answer satisfies the criteria, but finding the best solution without trying every single possibility may be impossible. This puzzle, and others like it, are referred to as P vs NP.

In Travelling Salesman , a quartet of mathematicians solve this problem -- they find a way to shortcut the brute-force process of trying every approach, instantaneously negating the way the world's encryption systems operates. They've been hired to do their work by the United States, but they're confronted with the moral quandary of whether to hand over their research to the government or publish it publicly for the whole world's benefit. "We wanted to make a film that felt authentic to a niche group, but also ultimately would be accessible to a wide audience," said Tim Lanzone, one of the movie's creators. "The film is science fiction, but we wanted the science part to be as accurate as possible," his brother and co-writer, Andy Lanzone, added.

It's set almost entirely around a conference table in a sleek, modern, government facility. Initially the four argue over the implications of their research, before a representative of the government arrives and their argument escalates significantly. "I wanted to see if I could contain drama in one room," says Tim Lanzone. "Film school professors always warn that the hardest and most difficult scenes to shoot occur around kitchen tables."

Of course, that makes shooting it cheap, too. The film has a definite DIY aesthetic, but it's impressive what Lanzone has managed to achieve within those constraints. He opted deliberately for a cool colour temperature to make the atmosphere intense and unsettling. "Most of the drama takes place in one room, so we looked to use any sort of additional drama we could harness to our advantage."

That atmosphere is paired with fast-paced and complex dialogue -- it's not a movie that you can put on in the background. Attempts are made to explain the mathematical ideas behind the plot, but you will get more out of it if you've done a little research beforehand. The Lanzones admit this. "Understanding P vs NP directly isn't essential to enjoying the film -- especially if you have some grasp of the implications," says Tim. "We try to simplify it as well as we can during certain scenes but the pace of the dialogue is so fast that a lot of people are just along for the ride."

The movie isn't about the maths, though. Travelling Salesman is a film about power, and how it should be distributed. The government representative's job is to convince the four to sign off their parts of the solution, but it's an uphill struggle as they grapple with the repercussions of what the knowledge would mean for the world.

The bogeyman of China is brought up repeatedly, but it's fascinating to watch the film in light of recent revelations about the extent to which the US and UK's security agencies are already violating global encryption systems through back doors created in many of the world's communication networks.

Matt Burgess

Andrew Couts

Emily Mullin

C. Brandon Ogbunu

The script was written long before Edward Snowden's revelations came to light, but Tim Lanzone says the topic had been on his mind for some time. "I wrote the first draft of the script back in early 2009, which in cyber-time is like an eternity. Back then, articles were really starting to come out more and more highlighting issues related to cyber-security and cyber-espionage -- particularly on important defence targets. It just seemed to be the next cold war-style battleground."

Andy Lanzone adds: "I don't know anyone that foresaw the scope of what the NSA is doing, so that was entirely coincidental. But the more general topic of cyber warfare was an interesting topic that we felt would only become more relevant over time."

The film firmly fails the Bechdel Test in that every one of the characters is white and male, limiting their perspectives considerably. The Lanzones blame this lack of diversity on budget: "We shot the film for under $25,000 and had a whirlwind casting session over two days in LA -- which was all the time we could afford," says Tim. "Knowing we only had about ten days to shoot Travelling Salesman , we were just trying to narrow it down to the five people who could most ably handle the complex language."

Ultimately, you'll get the same amount out of Travelling Salesman that you put into it. It's not a casual watch, but rewards concentration and occasionally pausing the movie and opening Wikipedia to check whether you've understood something right. If you were being cruel, you'd call it an argument for an hour and a half. But the themes and issues it addresses have never been more relevant -- the power of access to private communications, and whether it's right for that power to be concentrated under the auspices of one or a few governments. If you have strong feelings on the matter, on either side, Travelling Salesman is an essential watch.

This article was originally published by WIRED UK

Megan Farokhmanesh

Angela Watercutter

Jennifer M. Wood

• Rent or buy
• Categories Categories
• Getting Started

Travelling Salesman

Customers also watched.

Cast and Crew

673 global ratings

How are ratings calculated? Toggle Expand Toggle Expand

• Amazon Newsletter
• About Amazon
• Accessibility
• Sustainability
• Press Center
• Investor Relations
• Amazon Devices
• Amazon Science
• Sell on Amazon
• Sell apps on Amazon
• Supply to Amazon
• Protect & Build Your Brand
• Become an Affiliate
• Become a Delivery Driver
• Start a Package Delivery Business
• Advertise Your Products
• Self-Publish with Us
• Become an Amazon Hub Partner
• › See More Ways to Make Money
• Amazon Visa
• Amazon Store Card
• Amazon Secured Card
• Amazon Business Card
• Shop with Points
• Credit Card Marketplace
• Reload Your Balance
• Amazon Currency Converter
• Your Account
• Your Orders
• Shipping Rates & Policies
• Amazon Prime
• Returns & Replacements
• Manage Your Content and Devices
• Recalls and Product Safety Alerts
• Conditions of Use
• Privacy Notice
• Consumer Health Data Privacy Disclosure
• Your Ads Privacy Choices

Log in or sign up for Rotten Tomatoes

Trouble logging in?

By continuing, you agree to the Privacy Policy and the Terms and Policies , and to receive email from the Fandango Media Brands .

By creating an account, you agree to the Privacy Policy and the Terms and Policies , and to receive email from Rotten Tomatoes and to receive email from the Fandango Media Brands .

By creating an account, you agree to the Privacy Policy and the Terms and Policies , and to receive email from Rotten Tomatoes.

Email not verified

Let's keep in touch.

Sign up for the Rotten Tomatoes newsletter to get weekly updates on:

• Upcoming Movies and TV shows
• Trivia & Rotten Tomatoes Podcast
• Media News + More

By clicking "Sign Me Up," you are agreeing to receive occasional emails and communications from Fandango Media (Fandango, Vudu, and Rotten Tomatoes) and consenting to Fandango's Privacy Policy and Terms and Policies . Please allow 10 business days for your account to reflect your preferences.

OK, got it!

Movies / TV

No results found.

• What's the Tomatometer®?
• Login/signup

Movies in theaters

• Opening this week
• Top box office
• Coming soon to theaters
• Certified fresh movies

Movies at home

• Fandango at Home
• Netflix streaming
• Prime Video
• Most popular streaming movies
• What to Watch New

Certified fresh picks

• Abigail Link to Abigail
• Civil War Link to Civil War
• Arcadian Link to Arcadian

New TV Tonight

• The Sympathizer: Season 1
• Conan O'Brien Must Go: Season 1
• Under the Bridge: Season 1
• The Spiderwick Chronicles: Season 1
• Our Living World: Season 1
• Orlando Bloom: To the Edge: Season 1
• The Circle: Season 6
• Dinner with the Parents: Season 1
• Jane: Season 2

Most Popular TV on RT

• Fallout: Season 1
• Baby Reindeer: Season 1
• Shōgun: Season 1
• Ripley: Season 1
• 3 Body Problem: Season 1
• We Were the Lucky Ones: Season 1
• Sugar: Season 1
• Parasyte: The Grey: Season 1
• Best TV Shows
• Most Popular TV
• TV & Streaming News

Certified fresh pick

• Under the Bridge Link to Under the Bridge
• All-Time Lists
• Binge Guide
• Comics on TV
• Five Favorite Films
• Video Interviews
• Weekend Box Office
• Weekly Ketchup
• What to Watch

All Guy Ritchie Movies Ranked by Tomatometer

All A24 Movies Ranked by Tomatometer

What to Watch: In Theaters and On Streaming

Awards Tour

Renewed and Cancelled TV Shows 2024

Best Moments From The Migration Movie

• Trending on RT
• Rebel Moon: Part Two - The Scargiver
• The Ministry of Ungentlemanly Warfare
• Play Movie Trivia

Travelling Salesman

Where to watch.

Rent Travelling Salesman on Prime Video, Apple TV, or buy it on Prime Video, Apple TV.

Audience Reviews

Cast & crew.

Timothy Lanzone

Number Four

Marc Raymond

Tyler Seiple

Danny Barclay

No. 1 - Tim Horton

Best Movies to Stream at Home

• Cast & crew
• User reviews

Traveling Salesmen

• Episode aired Jan 11, 2007

Dwight does a favor for Angela to keep her from getting in trouble. Andy finds out and uses it against him to get in tighter with Michael. Now Dwight must fess up, which will reveal his rela... Read all Dwight does a favor for Angela to keep her from getting in trouble. Andy finds out and uses it against him to get in tighter with Michael. Now Dwight must fess up, which will reveal his relationship with Angela, or risk getting fired. Dwight does a favor for Angela to keep her from getting in trouble. Andy finds out and uses it against him to get in tighter with Michael. Now Dwight must fess up, which will reveal his relationship with Angela, or risk getting fired.

• Greg Daniels
• Michael Schur
• Lee Eisenberg
• Steve Carell
• Rainn Wilson
• John Krasinski
• 8 User reviews
• 3 Critic reviews

• Michael Scott

• Dwight Schrute

• Jim Halpert

• Ryan Howard

• Jan Levinson

• Stanley Hudson

• Kevin Malone

• Meredith Palmer

• Kelly Kapoor

• Angela Martin

• Phyllis Lapin

• Creed Bratton

• Andy Bernard

• Karen Filippelli

• Dwight and Jim's Customer

• (as Leon Simmons Jr.)
• All cast & crew
• Production, box office & more at IMDbPro

Did you know

• Trivia To create the picture of young Jim and Dwight, a high school photograph of John Krasinski was photoshopped alongside a 1991 picture of Rainn Wilson. At the time, Wilson was touring with an acting company.
• Goofs In many of the driving scenes, palm trees are visible through the car windows. There are no outdoor palm trees growing wild in Pennsylvania.

Michael Scott : You know what they say? "Fool me once, strike one. But fool me twice... strike three."

• Connections Featured in The Office: The Banker (2010)
• Soundtracks Kickstart My Heart (uncredited) Written by Nikki Sixx Performed by Mötley Crüe

User reviews 8

• Oct 28, 2021
• January 11, 2007 (United States)
• Deedle-Dee Productions
• Reveille Productions
• NBC Universal Television
• See more company credits at IMDbPro

Technical specs

• Runtime 22 minutes

Related news

Contribute to this page.

• See more gaps
• Learn more about contributing

More to explore

Recently viewed

Telegram üzerinden film ve dizi izlemek için kanalımıza katılabilirsiniz : https://t.me/+VQkD24IPC49jZDJk

E-postanız sadece moderatörler tarafından görünür.

• İzleme Listesi

The Salesman – Satıcı

• Yapım Yılı 2016
• Ülke Fransa , İran
• Yapım Şirketi Memento Films, Arte France Cinema, Doha Film Institute, Asghar Farhadi
• Film Süresi 124 dakika

İlginizi çekebilecek diğer filmler

Film hakkındaki düşüncelerinizi paylaşın

çok güzel bir film. iran filmleri gerçekten güzel.

Kaliteli bir film.

• Data Structures
• Linked List
• Binary Tree
• Binary Search Tree
• Segment Tree
• Disjoint Set Union
• Fenwick Tree
• Red-Black Tree
• Advanced Data Structures
• Graph Data Structure And Algorithms
• Introduction to Graphs - Data Structure and Algorithm Tutorials
• Graph and its representations
• Types of Graphs with Examples
• Basic Properties of a Graph
• Applications, Advantages and Disadvantages of Graph
• Transpose graph
• Difference Between Graph and Tree

BFS and DFS on Graph

• Breadth First Search or BFS for a Graph
• Depth First Search or DFS for a Graph
• Applications, Advantages and Disadvantages of Depth First Search (DFS)
• Applications, Advantages and Disadvantages of Breadth First Search (BFS)
• Iterative Depth First Traversal of Graph
• BFS for Disconnected Graph
• Transitive Closure of a Graph using DFS
• Difference between BFS and DFS

Cycle in a Graph

• Detect Cycle in a Directed Graph
• Detect cycle in an undirected graph
• Detect Cycle in a directed graph using colors
• Detect a negative cycle in a Graph | (Bellman Ford)
• Cycles of length n in an undirected and connected graph
• Detecting negative cycle using Floyd Warshall
• Clone a Directed Acyclic Graph

Shortest Paths in Graph

• How to find Shortest Paths from Source to all Vertices using Dijkstra's Algorithm
• Bellman–Ford Algorithm
• Floyd Warshall Algorithm
• Johnson's algorithm for All-pairs shortest paths
• Shortest Path in Directed Acyclic Graph
• Multistage Graph (Shortest Path)
• Shortest path in an unweighted graph
• Karp's minimum mean (or average) weight cycle algorithm
• 0-1 BFS (Shortest Path in a Binary Weight Graph)
• Find minimum weight cycle in an undirected graph

Minimum Spanning Tree in Graph

• Kruskal’s Minimum Spanning Tree (MST) Algorithm
• Difference between Prim's and Kruskal's algorithm for MST
• Applications of Minimum Spanning Tree
• Total number of Spanning Trees in a Graph
• Minimum Product Spanning Tree
• Reverse Delete Algorithm for Minimum Spanning Tree

Topological Sorting in Graph

• Topological Sorting
• All Topological Sorts of a Directed Acyclic Graph
• Kahn's algorithm for Topological Sorting
• Maximum edges that can be added to DAG so that it remains DAG
• Longest Path in a Directed Acyclic Graph
• Topological Sort of a graph using departure time of vertex

Connectivity of Graph

• Articulation Points (or Cut Vertices) in a Graph
• Biconnected Components
• Bridges in a graph
• Eulerian path and circuit for undirected graph
• Fleury's Algorithm for printing Eulerian Path or Circuit
• Strongly Connected Components
• Count all possible walks from a source to a destination with exactly k edges
• Euler Circuit in a Directed Graph
• Word Ladder (Length of shortest chain to reach a target word)
• Find if an array of strings can be chained to form a circle | Set 1
• Tarjan's Algorithm to find Strongly Connected Components
• Paths to travel each nodes using each edge (Seven Bridges of Königsberg)
• Dynamic Connectivity | Set 1 (Incremental)

Maximum flow in a Graph

• Max Flow Problem Introduction
• Ford-Fulkerson Algorithm for Maximum Flow Problem
• Find maximum number of edge disjoint paths between two vertices
• Find minimum s-t cut in a flow network
• Maximum Bipartite Matching
• Channel Assignment Problem
• Introduction to Push Relabel Algorithm
• Introduction and implementation of Karger's algorithm for Minimum Cut
• Dinic's algorithm for Maximum Flow

Some must do problems on Graph

• Find size of the largest region in Boolean Matrix
• Count number of trees in a forest
• A Peterson Graph Problem
• Clone an Undirected Graph
• Introduction to Graph Coloring

Traveling Salesman Problem (TSP) Implementation

• Introduction and Approximate Solution for Vertex Cover Problem
• Erdos Renyl Model (for generating Random Graphs)
• Chinese Postman or Route Inspection | Set 1 (introduction)
• Hierholzer's Algorithm for directed graph
• Boggle (Find all possible words in a board of characters) | Set 1
• Hopcroft–Karp Algorithm for Maximum Matching | Set 1 (Introduction)
• Construct a graph from given degrees of all vertices
• Determine whether a universal sink exists in a directed graph
• Number of sink nodes in a graph
• Two Clique Problem (Check if Graph can be divided in two Cliques)

Travelling Salesman Problem (TSP) : Given a set of cities and distances between every pair of cities, the problem is to find the shortest possible route that visits every city exactly once and returns to the starting point.  Note the difference between Hamiltonian Cycle and TSP. The Hamiltonian cycle problem is to find if there exists a tour that visits every city exactly once. Here we know that Hamiltonian Tour exists (because the graph is complete) and in fact, many such tours exist, the problem is to find a minimum weight Hamiltonian Cycle.  For example, consider the graph shown in the figure on the right side. A TSP tour in the graph is 1-2-4-3-1. The cost of the tour is 10+25+30+15 which is 80. The problem is a famous NP-hard problem. There is no polynomial-time known solution for this problem.   

Examples: 

In this post, the implementation of a simple solution is discussed.

• Consider city 1 as the starting and ending point. Since the route is cyclic, we can consider any point as a starting point.
• Generate all (n-1)! permutations of cities.
• Calculate the cost of every permutation and keep track of the minimum cost permutation.
• Return the permutation with minimum cost.

Below is the implementation of the above idea 

Time complexity:  O(n!) where n is the number of vertices in the graph. This is because the algorithm uses the next_permutation function which generates all the possible permutations of the vertex set.  Auxiliary Space: O(n) as we are using a vector to store all the vertices.

Please Login to comment...

Similar reads.

• NP Complete
• 10 Ways to Use Microsoft OneNote for Note-Taking
• 10 Best Yellow.ai Alternatives & Competitors in 2024
• 10 Best Online Collaboration Tools 2024
• 10 Best Autodesk Maya Alternatives for 3D Animation and Modeling in 2024
• 30 OOPs Interview Questions and Answers (2024)

Improve your Coding Skills with Practice

What kind of Experience do you want to share?

Wayne State University

Events calendar, ise seminar: equitable routing - rethinking the multiple traveling salesman.

Kaarthik Sundar, Scientist, Los Alamos National Laboratory

The Multiple Traveling Salesman Problem (MTSP) with a single depot is a generalization of the well-known Traveling Salesman Problem (TSP) that involves an additional parameter, namely, the number of salesmen. In the MTSP, several salesmen at the depot need to visit a set of interconnected targets, such that each target is visited precisely once by at most one salesman while minimizing the total length of their tours. An equally important variant of the MTSP, the min-max MTSP, aims to distribute the workload (length of the individual tours) among salesmen by requiring the longest tour of all the salesmen to be as short as possible, i.e., minimizing the maximum tour length among all salesmen. The min-max MTSP appears in real-life applications to ensure a good balance of workloads for the salesmen. It is known in the literature that the min-max MTSP is notoriously difficult to solve to optimality due to the poor lower bounds its linear relaxations provide. In this talk, we shall formulate two novel parametric variants of the MTSP called the "fair-MTSP". One variant is formulated as a Mixed-Integer Second Order Cone Program (MISOCP), and the other as a Mixed Integer Linear Program (MILP). Both focus on enforcing the workloads for the salesmen to be equitable, i.e., the distribution of tour lengths for the salesmen to be fair while minimizing the total cost of their tours. We present algorithms to solve the two variants of the fair-MTSP to global optimality and computational results on benchmark and real-world test instances that make a case for fair-MTSP as a viable alternative to the min-max MTSP.

Kaarthik received a Ph.D. and M.S. in Mechanical and Electrical Engineering, from Texas A&M University, College Station, TX, USA, in 2016 and 2012, respectively. He is a Scientist in the Information Systems and Modeling Group at Los Alamos National Laboratory, Los Alamos, NM, USA. His research interests include problems pertaining to vehicle routing, path planning, and control for unmanned/autonomous systems; non-linear optimal control, estimation, and large-scale optimization problems in power and gas networks, combinatorial optimization, and global optimization for mixed-integer non-linear programs.

Saran Venkatachalam [email protected]

Notable Places in the Area

Elektrostal Satellite Map

Popular Destinations in Moscow Oblast

Escape to a random place.