Some basic DFS and BFS functions
Bug #319525 reported by
Gábor Csárdi
| Affects | Status | Importance | Assigned to | Milestone | |
|---|---|---|---|---|---|
| igraph |
Fix Released
|
Medium
|
Gábor Csárdi | ||
Bug Description
From Kumud Singhal's email:
There does not seem to be a direct R interface to depth and breadth search algorithms. It would be nice if such routines were available. The default output would include the tree edges and a post or pre-visit order labeling, number of components, root nodes, etc.
| Changed in igraph: | |
| importance: | Undecided → Medium |
| status: | New → Confirmed |
| Changed in igraph: | |
| assignee: | nobody → gabor.csardi |
| status: | Confirmed → In Progress |
Revision history for this message
| Gábor Csárdi (gabor.csardi) wrote | #1 |
Revision history for this message
| Gábor Csárdi (gabor.csardi) wrote | #2 |
| Changed in igraph: | |
| status: | In Progress → Fix Released |
Revision history for this message
| Gábor Csárdi (gabor.csardi) wrote Continue on github | #3 |
To post a comment you must log in.
OK, BFS is mostly ready. Maybe we want to support giving many root vertices as an argument.