Properties
Category
English
Due On
20210401
Similar Topics
Statistics
Participants
1
Subscribers
1
Votes
1
Views
377
Share
Graph theory commands
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 PCtime?
kind regards
Ivan De Winne
 GeoGebra
 Help
 Partners

Contact us
 Feedback & Questions
 This email address is being protected from spambots. You need JavaScript enabled to view it.
 +43 677 6137 2693
© 2023 International GeoGebra Institute
Comments have been locked on this page!