Probably a mistake in DFS problem in CS practice

Original problem: https://brilliant.org/practice/depth-first-search/?p=1

I don't actually know if a solution to the problem is correct or not, but I have noticed a flaw in the explanation witch sometime yields wrong results. I outline the problem on paper, so please forgive my terrible handwriting (and my grammar, I am Russian, don't hurt me).

I am not sure if I am correct or not, but if this is of any use I am happy to help! (don't mind a little reward if you're do that, hehe)

My notes:

1:

2:

3:

P.S. I forgot to mention on paper: the problem is a little bit modified -- we only looking for number of vertices that are two hops from vertex 1.

#ComputerScience

Note by Андрей Антонов
1 year ago

No vote yet
1 vote

  Easy Math Editor

This discussion board is a place to discuss our Daily Challenges and the math and science related to those challenges. Explanations are more than just a solution — they should explain the steps and thinking strategies that you used to obtain the solution. Comments should further the discussion of math and science.

When posting on Brilliant:

  • Use the emojis to react to an explanation, whether you're congratulating a job well done , or just really confused .
  • Ask specific questions about the challenge or the steps in somebody's explanation. Well-posed questions can add a lot to the discussion, but posting "I don't understand!" doesn't help anyone.
  • Try to contribute something new to the discussion, whether it is an extension, generalization or other idea related to the challenge.
  • Stay on topic — we're all here to learn more about math and science, not to hear about your favorite get-rich-quick scheme or current world events.

MarkdownAppears as
*italics* or _italics_ italics
**bold** or __bold__ bold

- bulleted
- list
  • bulleted
  • list

1. numbered
2. list
  1. numbered
  2. list
Note: you must add a full line of space before and after lists for them to show up correctly
paragraph 1

paragraph 2

paragraph 1

paragraph 2

[example link](https://brilliant.org)example link
> This is a quote
This is a quote
    # I indented these lines
    # 4 spaces, and now they show
    # up as a code block.

    print "hello world"
# I indented these lines
# 4 spaces, and now they show
# up as a code block.

print "hello world"
MathAppears as
Remember to wrap math in \( ... \) or \[ ... \] to ensure proper formatting.
2 \times 3 2×3 2 \times 3
2^{34} 234 2^{34}
a_{i-1} ai−1 a_{i-1}
\frac{2}{3} 23 \frac{2}{3}
\sqrt{2} 2 \sqrt{2}
\sum_{i=1}^3 ∑i=13 \sum_{i=1}^3
\sin \theta sin⁡θ \sin \theta
\boxed{123} 123 \boxed{123}

Comments

Hi Андрей, thank you for notifying us. We will respond to you shortly.

Brilliant Mathematics Staff - 11 months, 4 weeks ago

Hi Андрей, sorry for the late response.

We looked at the NSA problem and how it would consume the network structure. It might be instructive to run the code on the examples you came up with. One of the early steps is to store the neighbor relationships in a dictionary, which is symmetric. After that is done, all information as to the order of how they appeared in the original file is lost, so the algorithm does not know about it.

In light of this, we still feel the answer and solution are correct, i.e., the output does not depend on the order of the edges in the given input.

It's possible we've missed something, so if you have more detailed critique of the problem, we're happy to take another look.

Best,
Brilliant

Brilliant Mathematics Staff - 11 months ago
×

Problem Loading...

Note Loading...

Set Loading...