单选题：Which of the following is a possible sequence of edges added by

Given a weighted undirected graph as shown below, with a given starting vertex. Which of the following is a possible sequence of edges collected by Prim's minimum spanning tree algorithm?






A.Starting from A: (A,B) -> (B,D) -> (B,E) -> (A,C) -> (D,F) -> (F,G)
B.Starting from B: (B,D) -> (A,D) -> (A,B) -> (B,E) -> (E,G) -> (F,G)
C.Starting from A: (A,C) -> (C,D) -> (D,F) -> (F,G) -> (E,G) -> (B,E)
D.Starting from B: (B,D) -> (B,E) -> (A,B) -> (A,C) -> (F,G) -> (D,F)


答案：A