Minimum Spanning Tree Possible and Not with Depth First Search Algorithm
I’ve got two questions the first question being
1.) Why Minimum Spanning Tree is possible with Depth First Search
2.) Why Minimum Spanning Tree is not Possible with Depth First Search
It would be great to get an answer for this Question with examples based on algorithm