Member Avatar for jborden

I need to write an algorithm for finding the maximum weighted independent set of a graph, G. Any idea of where I should start?

  • 2 Contributors
  • 1 Reply
  • 146 Views
  • 9 Hours Discussion Span
  • Latest Post Latest Post by deceptikon
Member Avatar for deceptikon

Do you know how to find the solution in a graph manually? If not, that's where you start. Understanding both the problem and how to reach a solution to the problem is paramount. You can't write code to do something you don't know how to do.

Be a part of the DaniWeb community

We're a friendly, industry-focused community of developers, IT pros, digital marketers, and technology enthusiasts meeting, networking, learning, and sharing knowledge.