| ▲ | Start Doing Graph Theory(vertex.degree) |
| 136 points by ibobev 5 days ago | 17 comments |
| |
|
| ▲ | hackerbrother 7 minutes ago | parent | next [-] |
| Cool. I am applying to jobs and it seems graph theory is popular in the "Leet Code" questions pace. So very timely, thank you! And clever domain name :) |
|
| ▲ | igleria an hour ago | parent | prev | next [-] |
| not super fond of my memories of having to come up with a graph demonstration on a fixed time on a paper exam, but at least I can say I was once a person that could do that! |
|
| ▲ | vorobeez an hour ago | parent | prev | next [-] |
| It's unfortunate that the book doesn't have solutions for practice problems. Which makes it hard to use for self-learning. |
| |
| ▲ | OgsyedIE 32 minutes ago | parent | next [-] | | The book you want in this case is Gross, Yellen & Anderson, Graph Theory and its Applications, 3rd Edition. There are plenty of ways to get a copy. | |
| ▲ | eru 26 minutes ago | parent | prev | next [-] | | You can ask Claude for the solutions? | | |
| ▲ | Gormo 12 minutes ago | parent [-] | | If you don't have the solutions, how do you verify Claude's work? | | |
| ▲ | DecoPerson 7 minutes ago | parent | next [-] | | Everything, except the bleeding edge and situations requiring the context window to be more than 60% filled, are elementary to Opus 5.5 . If you provide the questions completely, you can be very sure that Claude’s solutions will be correct. The world has changed; AI is reliable; we need to adapt. | |
| ▲ | deredede 8 minutes ago | parent | prev [-] | | According to current practices, you ask ChatGPT or DeepSeek to verify it. |
|
| |
| ▲ | 31 minutes ago | parent | prev [-] | | [deleted] |
|
|
| ▲ | throwaw12 an hour ago | parent | prev | next [-] |
| that background is so annoying to my eyes when scrolling the content, would be great if author can fix it |
|
| ▲ | rdevilla an hour ago | parent | prev | next [-] |
| [dead] |
|
| ▲ | cedarbyte482 an hour ago | parent | prev [-] |
| This is great, graphs is also the answer to autonomous coding :D |
| |
| ▲ | roarcher an hour ago | parent | next [-] | | How so? | | |
| ▲ | cedarbyte482 an hour ago | parent [-] | | We have experienced that adverserial review cycles is the only way to really guarantee good outputs from coding agents - best modelled as a cyclic graph. | | |
| ▲ | sandos 36 minutes ago | parent | next [-] | | I am even more confused after this answer: Are the nodes actual reviews or something else? | |
| ▲ | eru 25 minutes ago | parent | prev [-] | | I don't think modelling this as a graph adds anything that you wouldn't get from the phrase 'adversarial review cycles' already. So graph theory is pretty much useless for this application. Please prove me wrong. |
|
| |
| ▲ | an hour ago | parent | prev [-] | | [deleted] |
|
