How to apply Pathfinding in a structure of nodes?

Question

I have a node structure that represents my pages and their links, for example, from page A I can go to page B or page C. In addition I can have page A pointing to page B pointing to C pointing again to A. What I need to do is determine a source page and a destination page, and display only the related nodes, for example leaving A, to reach H.

Which algorithm is used to find this type of path?

Answer 1

There are several algorithms for this purpose, among them (all in English):

Dijkstra’s

Here’s an example of pseudo-code taken from the link:

function Dijkstra(Graph, source):

       create vertex set Q

       for each vertex v in Graph:             
           dist[v] ← INFINITY
           prev[v] ← UNDEFINED
           add v to Q

      dist[source] ← 0

      while Q is not empty:
          u ← vertex in Q with min dist[u]
          remove u from Q 

          for each neighbor v of u:           
              alt ← dist[u] + length(u, v)
              if alt < dist[v]:
                  dist[v] ← alt 
                  prev[v] ← u 

      return dist[], prev[]

D* Algorithm D-Star

Algorithmic Any-Angle path Planning

To* Algorithm A-Star