I am taking an undergraduate course targeted at both CS and math students, called "efficient algorithms". It explains graph algorithms, like solutions for the Travelling salesman etc. It is not about implementing them, but about proving why they work. Now there are some things I don't understand about a maximum flow algorithm, and wanted to ask a question.
I am however not sure whether I should ask it here or on theoretical cs. I believe that this is a shared topic, so I hope it is on-topic for both sites, but where do you think is the higher chance to get a good answer? Or is it only on-topic for one of the sites?