Consider the following undirected graph with edge weights as shown:

The number of minimum-weight spanning trees of the graph is ______

Breadth First Search $$(BFS)$$ is started on a binary tree beginning from the root vertex. There is a vertex $$t$$ at a distance four from the root. If t is the $$n$$-th vertex in this $$BFS$$ traversal, then the maximum possible value of $$n$$ is ___________.

Consider the following directed graph:

The number of different topological orderings of the vertices of the graph is ________________.

Consider the tree arcs of a BFS traversal from a source node W in an unweighted, connected, undirected graph. The tree T formed by the tree arcs is a data structure for computing