Set V={a,b,c,d,e,f},E={a,b,b,c,c,a,a,d,d,e,f,e},thendirected graph G=V,E is ( )
A: Weakly connected
B: Strongly connected
C: One-sided
D: Unconnected
A: Weakly connected
B: Strongly connected
C: One-sided
D: Unconnected
A
举一反三
- Set V={a,b,c,d,e,f},E={[a,b],[b,c],[c,a],[a,d],[d,e],[f,e]},then directed graph G=[V,E] is ( ) A: Weakly connected B: Strongly connected C: One-sided D: Unconnected
- Determine whether the graphs is strongly connected or weakly connected.[img=318x210]1803bce821b1b87.png[/img] A: strongly connected B: Weakly connected
- 已知有向图G=(V,E),其中V={a,b,c,d,e,f,g},E={<a,b>,<a,c>,<a,d>,<b,e>,<c,e>,<c,f>,<d,f>,<e,g>,<f,g>}G的拓扑序列是( ) A: a,c,d,f,b,e,g B: a,c,b,f,d,e,g C: a,c,d,e,b,f,g D: a,b,e,c,d,f,g
- 中国大学MOOC: 设图G=(V,E),其中V={a,b,c,d,e,f,g},E={{a,b},{a,c},{b,c},{b,d},{b,e},{c,d},{c,f},{d,e},{d,f},{e,g},{e,f},{f,g}},则图G的色数为()。
- 设图G=(V,E),其中V={a,b,c,d,e,f,g},E={{a,b},{a,c},{b,c},{b,d},{b,e},{c,d},{c,f},{d,e},{d,f},{e,g},{e,f},{f,g},{a,g}},则图G的色数为()。 A: 1 B: 2 C: 3 D: 4
内容
- 0
设图G=(V,E),其中V={a,b,c,d,e,f,g},E={{a,b},{a,c},{b,c},{b,d},{b,e},{c,d},{c,f},{d,e},{d,f},{e,g},{e,f},{f,g}},则图G的色数为()。 A: 1 B: 2 C: 3 D: 4
- 1
设图G = (V, E),其中V = {A,B,C}, E = {{A,B},{A,C}}, 图G'={U,F},其中U={D,E,F}, F = {{D,E}, {E,F},{F,D}},则图G和图G'同构。 A: 正确 B: 错误
- 2
设图G = (V, E),其中V = {A,B,C}, E = {{A,B},{A,C}}, 图G'={U,F},其中U={D,E,F}, F = {{D,F}, {F,E}},则图G和图G'同构。 A: 正确 B: 错误
- 3
中国大学MOOC: 设图G = (V, E),其中V = {A,B,C}, E = {{A,B},{A,C}}, 图G={U,F},其中U={D,E,F}, F = {{D,F}, {F,E}},则图G和图G同构。
- 4
37.___________ A: reduce B: connected C: providers D: linking E: calculated F: prevented G: surgeons
