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
举一反三
- 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: 错误