# Open Travelling Salesman Problem

Hi!

I wanted to use the A* search implementation in MatlabBGL for solving the Open Traveling Salesman problem with a given starting node (i.e. the salesman doesn't have to return to the starting node but just has to cover the whole graph). Can you kindly give me some pointers where I should be looking for additional documentation/

I am trying to understand how to change the stopping criterion in A* from finding the goal node to traveling all the nodes (path length).

Also I would need to add graph properties so if you can share those examples as well.

Thanks a ton!

#M

PS: I am a beginner with these graph libraries but do know matlab

## Question information

- Language:
- English Edit question

- Status:
- Answered

- For:
- Matlab BGL Edit question

- Assignee:
- No assignee Edit question

- Last query:

- Last reply:

## Can you help with this problem?

Provide an answer of your own, or ask Mohit for more information if necessary.