exhaustive search
Can someone give me a general idea on how to setup pseudo code for an exhaustive search algorithm to find n number subsets with not connected edges?
The undirected graph is in the adjacent matrix form.
Thank you!
Warning: I am not good at a pseudo code...I tend to think more like a human where I need to think as a computer.
The undirected graph is in the adjacent matrix form.
Thank you!
Warning: I am not good at a pseudo code...I tend to think more like a human where I need to think as a computer.
Last edited on
> I tend to think more like a human where I need to think as a computer
Write it for a human
If the computer does not understand one instruction, explode it.
_ take n nodes
_ check that there is no edge between any pair
Write it for a human
If the computer does not understand one instruction, explode it.
_ take n nodes
_ check that there is no edge between any pair
Last edited on
Topic archived. No new replies allowed.