[Cs5500] P3- Part 2

[tkoc at ccs.neu.edu]

  Hi,

  Regarding part 2 in project 3, in class we mentioned that G,s and t are instance and v is solution and claim is a boolean (true or false).
  In this case, how can we make a claim without knowing the graph because graph is given with instance. I think the graph should be given first like the equation given in mmg playground. 
  On the other hand, graph can change. There isn`t a specific graph for this playground like we had in mmg. 
  Can someone clear this up for me?

  Thanks,

  Tuba