I have a graph with 2 vertices. They each have a directed weighed edge towards the other vertex. One of the weights is higher than the other. Would this graph count as a graph that has a different shortest path tree than minimum spanning tree? Since you could have the shortest path tree start at the vertex that has a heavier edge to the other vertex.
Edit: the question I’m trying to solve is to draw the graph with the smallest number of vertices that has a different minimum spanning tree than shortest path tree, you already allowed to draw any kind of graph.