Anki Deck Changes

Commit: d850df12 - add dfs O(m) case

Author: obrhubr <obrhubr@gmail.com>

Date: 2026-01-13T11:35:33+01:00

Changes: 1 note(s) changed (1 added, 0 modified, 0 deleted)

Note 1: ETH::A&D

Deck: ETH::A&D
Note Type: Horvath Cloze
GUID: Dn~?XXlS(X
added

Previous

Note did not exist

New Note

Front

ETH::1._Semester::A&D::09._Graph_Search::1._Depth_First_Search
We can run DFS in \(O(m)\) if we know the graph is connected, i.e. \(m \geq n - 1\).

Back

ETH::1._Semester::A&D::09._Graph_Search::1._Depth_First_Search
We can run DFS in \(O(m)\) if we know the graph is connected, i.e. \(m \geq n - 1\).
Field-by-field Comparison
Field Before After
Text We can run DFS in&nbsp;\(O(m)\)&nbsp;if {{c1:: we know the graph is connected, i.e.&nbsp;\(m \geq n - 1\)}}.
Tags: ETH::1._Semester::A&D::09._Graph_Search::1._Depth_First_Search
↑ Top