Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Jump to bottom

In the graph section under corner cases, handbook refers to "disjoint graphs" but I think it means "disconnected graphs" #545

Closed
ghost opened this issue Nov 8, 2022 · 0 comments · Fixed by #573
Closed

In the graph section under corner cases, handbook refers to "disjoint graphs" but I think it means "disconnected graphs" #545

ghost opened this issue Nov 8, 2022 · 0 comments · Fixed by #573

Comments

@ghost
Copy link

ghost commented Nov 8, 2022

https://www.techinterviewhandbook.org/algorithms/graph/#corner-cases

Most of the review materials I've looked at refer to disconnected graphs, examples:
https://www.geeksforgeeks.org/bfs-disconnected-graph/
https://algo.monster/problems/graph_intro (paid content)

Googling, disjoint typically refers to edges/paths, but not graphs.
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Assignees
No one assigned
Labels
None yet
Projects
None yet
Milestone
No milestone
Development

Successfully merging a pull request may close this issue.

contents(algo): s/disjoint/disconnected mahehsblogs/tech-interview-handbook
0 participants