Update BuildingTeams PySol content/3_Silver/Graph_Traversal.mdx

[CryoJS]

Description

Adds new Python Solutions to https://cses.fi/problemset/task/1668/ for content/3_Silver/Graph_Traversal.mdx.
Relates to #3444

Runtimes

DFS (missing Python): https://cses.fi/problemset/result/11118878/ (0.74s)
Previous BFS Sol: https://cses.fi/problemset/result/11118911/ (0.90s)
New BFS Sol: https://cses.fi/problemset/result/11118910/ (0.69s)

Note: Updated/changed the pre-existing Python BFS solution as I had a simpler, faster solution.

---

Place an "x" in the corresponding checkbox if it is done or does not apply to this pull request.

• I have tested my code.
• I have added my solution according to the steps here.
• I have followed the code conventions mentioned here.
  • I understand that if it is clear that I have not attempted to follow these conventions, my PR will be closed.
  • If changes are requested, I will re-request a review after addressing them.
• I have linked this PR to any issues that it closes.

[SansPapyrus683]

alright thanks for agreeing to revert ❤️
could you just submit the code one more time please? for both sols
ik for the other one you just changed the listcomp to an asterisk but i just want to make sure

[CryoJS]

Yep, of course!

[CryoJS]

Here are the newest submissions:
DFS -> https://cses.fi/problemset/result/11193528/ (AC, slowest is 0.73s)
BFS -> https://cses.fi/problemset/result/11193531/ (AC, slowest is 0.90s)

I couldn't find any optimizations, the code is pretty much exactly the same as the C++ code.
Nevertheless, how they managed to make BFS run slower than DFS, I don't know lol.

[SansPapyrus683]