Is there a difference between connected and strongly connected in the context of graph theory?

Yes, in graph theory, a connected graph is one where there is a path between every pair of vertices, while a strongly connected graph is one where there is a directed path between every pair of vertices.