题目内容：
设某强连通图中有n个顶点，则该强连通图中至少有（ ）条边。,A.n(n-1) B.n+1 C.n D.n(n+1)
参考答案：
选择题：设某强连通图中有n个顶点，则该强连通图中至少有（ ）条边。,A.n(n-1) B.n+1 C.n D
- 题目分类：西安交通大学---数据结构
- 题目类型：选择题
- 号外号外：注册会员即送体验阅读点！
By local doctors and nurses, we hope more people.
By local doctors and nurses, we hope more people. ( )(本题5.0分) A、 train, help B、
Peasants earn their living by selling agriculture
Peasants earn their living by selling agriculture _____ in ChinaThe(本题1.0分) A、 c
( )—Would you like to have dinner with me this Sat
( )—Would you like to have dinner with me this Saturday, Mr. Wang? —_____.(本题5.
理的绝对性是指它的( )(本题5.0分)A、 永恒性；B、 客观性；C、 不变性；；D、 终极性；
理的绝对性是指它的( )(本题5.0分)A、 永恒性；B、 客观性；C、 不变性；；D、 终极性；
用链表表示线性表的优点是（）,A.便于随机存取 B.花费的存储空间比顺序表少 C.便于插入与删除 D
用链表表示线性表的优点是（）,A.便于随机存取 B.花费的存储空间比顺序表少 C.便于插入与删除 D.数据元素的物理顺序与逻辑顺序相同