Check the current structure with cmfonsec

[jeanpm]

Questions:

• Space as the power set of components? S = 2^C
• Distance computed in terms of components
• Solution class responsibilities

[jeanpm]

Conclusions:

• Space is defined from the power set of C,
• In constructive methods, the distance between solutions is given in terms of components,
• Solutions manage components c \in C by defining their states: present, absent, unknown
  • A solution is complete if all the components in C have their state in: present or absent.
  • A solution is partial if any component in C has its state defined as unkown.
• The neighborhood structure should be given more freedom to change solutions state
  • Example (minimum spanning tree problem):
  • Prim's algorithm defines a neighborhood by adding to x a component c in unknown state.
  • After c is added, it becomes present whereas other components might become absent.
  • Kruskal's algorithm is different o Prim's in terms of the components that become absent.