In the adjacency list of a directed graph, the number of nodes in each vertex singly linked list is equal to of the vertex.
A: out_degree
B: in_degree
C: degree
D: nothing
A: out_degree
B: in_degree
C: degree
D: nothing
A
举一反三
- 6. The most common operation for setting a linked list is to insert a node at the end and delete the tail node, so () is the most time-saving option. A: doubly linked circular list with a head node B: singly linked list C: singly linked circular list with a tail pointer D: singly linked circular list
- 16. In the representation of a graph, only has one representation is (). A: Adjacency matrix representation B: Adjacency list representation C: Reverse adjacency list representation D: Adjacency list and inverse adjacency list representation
- Which of the following are the two dimensions of environmental uncertainty? A: degree of change and degree of complexity B: degree of change and degree of volume C: degree of complexity and degree of impact D: degree of impact and degree of timing
- You<br/>are given pointers to first and last nodes of a singly linked list,<br/>which of the following operations are dependent on the length of the<br/>linked list? () A: Delete<br/>the first element B: Insert<br/>a new element as a first element C: Delete<br/>the last element of the list D: Add<br/>a new element at the end of the list
- In a doubly linked list, each node has links to the previous and next nodes in the list. A: 正确 B: 错误
内容
- 0
After four years in America, he got ______ A: a degree of doctor B: a doctor’s degree C: the degree of a doctor D: a doctor degree
- 1
Java语言由下列哪个公司发布的 A: degree=1 B: degree=2 C: degree=3 D: degree=4
- 2
2. He has . A: A. the degree of a doctor B: B. a degree of the doctor C: C. a doctor's degree D: D. a doctors' degree
- 3
The degree of dominance is established by the________. A: repetition of shapes B: degree of contrast C: similarities of shapes D: degree of similarities
- 4
Here must be an even number ( ) in any graph. A: Node with even degrees B: The node of the entry degree is odd. C: Nodes with odd degrees D: The node of the outing is an odd number.