Movatterモバイル変換

[0]ホーム
URL:

Skip to content

Navigation Menu

Sign in
Appearance settings

Search code, repositories, users, issues, pull requests...

Provide feedback

We read every piece of feedback, and take your input very seriously.

Saved searches

Use saved searches to filter your results more quickly

 Sign up
Appearance settings

Graph tree check#6318

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.

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

Already on GitHub?Sign in to your account

Open
amankumar100 wants to merge6 commits intoTheAlgorithms:master
base:master
Choose a base branch
Loading
fromamankumar100:Graph-Tree-Check
Open
Changes from1 commit
Commits
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
PrevPrevious commit
NextNext commit
updated
  • Loading branch information
@amankumar100
amankumar100 committedJun 26, 2025
commit0125571fd298e73a651c7f6175c9570d796b5343
View file
Open in desktop
Original file line numberDiff line numberDiff line change
Expand Up@@ -6,7 +6,6 @@
* Check if an undirected graph is a tree using Depth-First Search (DFS).
* A graph is a tree if it is connected and acyclic.
* This implementation reads an adjacency matrix as input and verifies both conditions.
*
* Wikipedia Reference: https://en.wikipedia.org/wiki/Tree_(graph_theory)
* Author: Aman
*/
Expand Down
Loading
[8]ページ先頭
©2009-2025 Movatter.jp