Method, terminal, and computer storage medium for identifying information during navigation

A terminal, comprising:

• at least one memory operable to store program code;
• and
• at least one processor operable to read the program code and operate as instructed by the program code, the program code comprising:
• data obtaining code configured to cause the at least one processor to extract fork data from navigation data, the fork data corresponding to a first road having a fork;
• extraction code configured to cause the at least one processor to extract, from the fork data, a first node on an entrance road and a first exit road, a second exit road, and a third exit road, the first, second, and third exit roads being roads in different directions and one or more of the first, second, and third exit roads being connected to the first node;
• first identification code configured to cause the at least one processor to identify the fork data as corresponding to a three-way fork in response to all of the first, second, and third exit roads converging at the first node, and perform first navigation broadcasting to graphically represent the first road as a three-forked road at which the first, second, and third roads are separated from the first node;
• and
• query code and second identification code, wherein, in response to not all of the first, second, and third exit roads converging at the first node:
• the query code is configured to cause the at least one processor to query a second node adjacent to the first node, the second node being a nod at which any of the first, second, and third exit roads not converging at the first node converges;
• and
• the second identification code is configured to cause the at least one processor to:
• identify the fork data as corresponding to the three-way fork based on a distance between the first node and the second node that meets a preset condition;
• and
• perform second navigation broadcasting to graphically represent the first road as the three-forked road at which the first, second, and third exit roads converge and are separated at the first node, the first navigation broadcasting and the second navigation broadcasting providing the same graphical representation of the first road,
• wherein the second identification code comprises first correction code configured to cause the at least one processor to, after identifying the fork data as corresponding to the three-way fork, and before performing the second navigation broadcasting, performing the following:
• detecting whether all of the first, second, and third exit roads are located in a fan-shaped area ahead in a traveling direction, the fan-shaped area having a center angle less than or equal to a second threshold, the second threshold being less than 180 degrees;
• and
• correcting identification of the fork data as corresponding to a non-three-way fork in response to all of the first, second, and third exit roads not being located in the fan-shaped area of which the angle range is less than or equal to the second threshold,
• wherein the second navigation broadcasting to graphically represent the first road as the three-forked road is not performed based on the first, second, and third exit roads being identified as the non-three-way fork.

A non-transitory computer storage medium storing instructions, which, when executed by at least one processor, cause the at least one processor to perform a method comprising:

• extracting fork data from navigation data, the fork data corresponding to a first road having a fork;
• extracting, from the fork data, a first node on an entrance road and a first exit road, a second exit road, and a third exit road, the first, second, and third exit roads being roads in different directions and one or more of the first, second, and third exit roads being connected to the first node;
• identifying the fork data as corresponding to a three-way fork in response to all of the first, second, and third exit roads converging at the first node and performing first navigation broadcasting to graphically represent the first road as a three-forked road at which the first, second, and third roads are separated from the first node;
• in response to not all of the first, second, and third exit roads converging at the first node, performing the following:
• querying a second node adjacent to the first node, the second node being a node at which any of the first, second, and third exit roads not converging at the first node converges;
• and
• identifying the fork data as corresponding to the three-way fork based on a distance between the first node and the second node that meets a preset condition;
• and
• performing second navigation broadcasting to graphically represent the first road as the three-forked road at which the first, second, and third exit roads converge and are separated at the first node, the first navigation broadcasting and the second navigation broadcasting providing the same graphical representation of the first road,
• the method further comprising, after the identifying the fork data as corresponding to the three-way fork, and before performing the second navigation broadcasting, performing the following:
• detecting whether all of the first, second, and third exit roads are located in a fan-shaped area ahead in a traveling direction, the fan-shaped area having a center angle less than or equal to a second threshold, the second threshold being less than 180 degrees;
• and
• correcting identification of the fork data as corresponding to a non-three-way fork in response to all of the first, second, and third exit roads not being located in the fan-shaped area of which the angle range is less than or equal to the second threshold,
• wherein the second navigation broadcasting to graphically represent the first road as the three-forked road is not performed based on the first, second, and third exit roads being identified as the non-three-way fork.