Answered: Topological Sort

Mon, 05 Dec 2016 21:29:08 +0000

1. DFS the graph: as each vertex is finished, insert it in a linked list.

2. Return the linked list of vertices.

Total cost: O(|V| + E).

Answered: Finding non-leaf node of a tree with no large subtrees

Mon, 05 Dec 2016 21:13:14 +0000

1. Recursively calculate the number of node in sub-tree with each node. //O(n)

2. DFS the tree; for each node i, father of the node f, and its children c_k, if node_cnt[c_k] <= n/2 and node_cnt[f] - node_cnt[i] <= n/2, the node is answer. //O(n)

The total cost is O(n).

Algorithms Q&A - Recent questions and answers in Backtracking/DFS/BFS

Answered: Topological Sort

Answered: Finding non-leaf node of a tree with no large subtrees