About the A * algorithm, each development F the smallest node, then CLOSED the G score list of nodes may not is the smallest, so eventually seek out path does not necessarily is the shortest? That I don't quite understand, hope leaders help me,