Skip to main content
Software Engineering
ZogStriP's user avatar
ZogStriP's user avatar
ZogStriP's user avatar
ZogStriP
  • Member for 12 years, 10 months
  • Last seen more than 2 years ago
Profile Activity

17 Actions

All Accepts Posts Badges Comments Revisions Reviews Suggestions
awarded
 Scholar
accepted
Collaborative graph exploration algorithm
awarded
 Teacher
awarded
 Benefactor
answered
Collaborative graph exploration algorithm
comment
Collaborative graph exploration algorithm
Sorry about that. It turns out I'm bad at asking "good" questions...
awarded
 Promoter
revised
Collaborative graph exploration algorithm
Added an example
revised
Collaborative graph exploration algorithm
typo
awarded
 Editor
comment
Collaborative graph exploration algorithm
I've re-worded my question to put an emphasis on my problem: which is how to best organize the exploration of the spanning tree.
revised
Collaborative graph exploration algorithm
reworked the question following up to the 1st answer
comment
Collaborative graph exploration algorithm
So I've been reading a lot, and it seems like in an unweighted (or "sameweighted") undirect graph like I have, doing a BFS or a DFS will give you the MST (plus, any spanning tree is a minimum spanning tree) - cs.stackexchange.com/questions/23179/…
awarded
 Student
awarded
 Supporter
asked
Collaborative graph exploration algorithm
awarded
 Autobiographer