Graph theory commands

ivandewinne shared this question 2 months ago
Needs Answer

1° In graph theory you can calculate te shortest distance from vertex A to Z with the Dijkstra algoritm.

GeoGebra has the command ShortestDistance[ ]

What is the algoritm that GeoGebra uses?

2° The travelling salesman problem is a very hard problem to solve with a computer?

For a small number of vertices in the graph the calculation time is acceptable

and GeoGebra will show the correct answer.

What is het maximum of vertices you can use in GeoGebra because of this limitation op PC-time?

kind regards

Ivan De Winne

© 2021 International GeoGebra Institute