Math Question

Post Reply New Topic

Does anyone know if a Dijkstra Algorithm is a exact or approximate algorithm? Also, if it's a efficient or inefficient algorithm? I believe this has something to do with graph theory.

Anyways, my math teacher asked us to do this for homework. The textbook doesn't even have what a Dijkstra Algorithm is supposed to be or mean. The teacher never elaborated on what this algorithm is. I don't have a clue of what it means. I'm not that great at math, but don't have a clue of how I'm supposed to figure out the qquestion

Google and Wikipedia are your friends.

Google tells me that it is exact and efficient. Wikipedia says that it is used often; that should be enough to indicate that it is efficient because otherwise people would look for something else. I really have no idea what it is and had never heard of it before this thread.

Hah, I actually came about it while I was randomly browsing Wikipedia's Math section this morning.