Timeline for Find the lengths of strongly connected components in a graph
Current License: CC BY-SA 4.0
10 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Oct 23, 2019 at 16:10 | comment | added | Peter Taylor | @Gloweye, graph traversal is indeed in NP, but it's also in P, and OP is correct to say that it's in \$O(V + E)\$ (although this particular implementation isn't). | |
| Oct 23, 2019 at 16:09 | answer | added | Peter Taylor | timeline score: 2 | |
| Oct 23, 2019 at 15:34 | history | edited | Clock Slave | CC BY-SA 4.0 |
deleted 27 characters in body; edited title
|
| Oct 23, 2019 at 13:54 | comment | added | IEatBagels | I understand there might be a need for a little bit more information but I really don't think this post should be closed, the code is there, works to OPs knowledge and the title is fine. | |
| Oct 23, 2019 at 11:14 | comment | added | Gloweye | Also, welcome to Code Review. Please read the tour if you haven't, or How to Ask if you want to know more about what questions exactly we want. Note that if it turns out you're looking for mathematical help, this question may be migrated towards a more suitable site. | |
| Oct 23, 2019 at 11:12 | comment | added | Gloweye | Graph traversal is an NP class of problem. That ALL algorithms we are aware off scale horribly. While I can't claim to be intimately familiar with graph traversal, I also don't see any glaring issues. How big, exactly, is the size of the Graphs when you get MemoryErrors? Does "really big" mean 1000 nodes or 1000000 nodes? | |
| Oct 23, 2019 at 10:53 | history | edited | πάντα ῥεῖ | CC BY-SA 4.0 |
added 10 characters in body
|
| Oct 23, 2019 at 10:50 | review | Close votes | |||
| Oct 23, 2019 at 14:42 | |||||
| Oct 23, 2019 at 10:35 | review | First posts | |||
| Oct 23, 2019 at 11:14 | |||||
| Oct 23, 2019 at 10:32 | history | asked | Clock Slave | CC BY-SA 4.0 |