Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- for (int comp = 0; comp < all_components.size(); comp++) {
- bool find_edge = true;
- for (int vert : all_components[comp]) {
- for (int child : graph[vert]) {
- if (which_comp[child] != comp) {
- find_edge = false;
- }
- }
- }
- if (find_edge) {
- stock++;
- }
- }
- for (int comp = 0; comp < all_components.size(); comp++) {
- bool find_edge = true;
- for (int vert : all_components[comp]) {
- for (int child : t_graph[vert]) {
- if (which_comp[child] != comp) {
- find_edge = false;
- }
- }
- }
- if (find_edge) {
- not_stock++;
- }
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement