IOM 2018, Блиц, английски — Задача 55

OLYMPIAD OF METROPOLISES. Moscow, September 3 · 3 септември 2018 г.

Условие

How many valid DFS subtrees, with root at the dark node (the root is the DFS algorithm starting point), are possible for the graph below? Note: A valid DFS subtree is the set of the edges which the DFS algorithm uses to traverse the graph.

Undirected graph of six vertices arranged as a triangle subdivided into four smaller triangles: a dark filled vertex at the top, two white vertices in the middle row and three white vertices in the bottom row, with nine edges.

Отговори

Решение

Оригинал в Архива: blitz.pdf · официални решения: blitz-answers.pdf