How to quickly collapse nodes in a graph where each node should be accepted/rejected?
I need to represent relationships between people as a graph in order to create a list of people that should be invited to a party. Each relationship is given as a tuple (A, B, cond), where A and B are different people and cond is one of the following:
Fix the graph to be Eulerian
I was trying to make a uni project that generates graph with given values and makes it eulerian if it’s not but the supposed fixed graph still has odd degree verticies.Please help me find the problem.Probably in FixGraph().It’s repearing the stuff a bit but it still doesn’t solve the problem entirely (some veritices still odd).