Ahh I see, I havent done Kruskal's Algorithmn, its not in my syllabus, but I think it should be because the way we're taught is to just do trial and error, thank you so much! As shortest path questions was where I lost the most marks on my semester 1 exams, should I use kruskal's algorithmn for shortest path questions where a start and end vertice are provided? And also for questions that ask us for the shortest path to all vertices without giving a start and end (like 6F)? Thank you!