The advanced math teacher genuinely had no idea what Dijkstra's Algorithm was.
It was not that she lacked knowledge, but that this touched on a more specialized field.
Of course,
Dijkstra's Algorithm did not exist in this world either. The algorithm Yan Xiao had written was, in fact, a completely original innovation.
As a teacher with years of experience, she was not embarrassed by her inability to answer Lin Fangxin's question.
Instead, she handled it by saying, "Let's discuss this after class. Your question is a little beyond the syllabus."
With that, the advanced math teacher went back to her lecture.
And she swore
that she would never call on Lin Fangxin or Yan Xiao to answer a question again.
Those two were permanent fixtures on her "do not call on" blacklist.
The class
finally came to a peaceful end.
Yan Xiao also woke up to the ringing of the bell.
"Is class over?" he asked, rubbing his eyes.
"Yes. Now hurry up and tell me what Dijkstra's Algorithm is!" Lin Fangxin pressed him immediately.
"Oh, that..." After a pause, Yan Xiao continued, "How about we get everyone in our group together first?"
"Explain it now. No food until you're done!" Lin Fangxin firmly rejected Yan Xiao's attempt to slack off.
Left with no choice, Yan Xiao said, "To explain Dijkstra's Algorithm, we also have to talk about A*. Dijkstra's Algorithm builds on the Breadth-First Search Algorithm by introducing the cost from the starting point to the current node.
That is: F = g F=g F=g
g g g is generally defined as the distance cost from the starting point to the current point. As you can see, this algorithm is still essentially a traversal with no directional bias. Although it guarantees that the optimal path will be found if