Need help with data Structures - graphs c++

Question

c) a function for a shortest path algorithm (perhaps shortest_path(source, destination))

d) a function for a minimum spanning tree algorithm (example min_span_tree()).

I have the rest of the code with me

Answer 1

Hello there, more context would be beneficial from this question, but here is my best answer in pseudo code.

c)

int shortest_path(source,destination,paths)

{

if(source!=destination)

{

foreach path in paths

return shortest_path(path,destination,pathsOfPath)+1;//1 or the weight of the path

//pathsOfPath and paths could be in a list or 2d array

}

return 0;

}

}

d)

REFER TO Kruskal's Algorithm!

whenCreatingPath(visitedNodes,currentNode)

{

if(visitedNodes.contains(currentNode))

throw away

else

visitedNodes.add(currentNode)

}

}