I have a problem about the calculation of shortest paths on an unweighted and undirected graph.Which algorithm I use to calculate the shortest path between a node A and node B that passing through a node C on an undirected and unweighted graph?
What algorithm should I use to find the shortest path in this graph
graph