To extend the HPLC algorithm to handle dynamic graphs, where the graph structure changes over time, several modifications and considerations need to be taken into account. One approach could involve updating the landmark selection and clustering process periodically as the graph evolves. This would require reevaluating the degree centrality of nodes and potentially reassigning landmarks based on the updated graph structure. Additionally, the hierarchical position embedding could be adjusted to incorporate temporal information, such as timestamps on edges or nodes, to capture the temporal dynamics of the graph. By integrating these temporal aspects into the algorithm, HPLC can adapt to changes in the graph structure and continue to provide accurate positional information for link prediction in dynamic graphs.