//////////////////////////////////////////////////////////////////////////////
//?Example?illustrating?the?use?of?GCoptimization.cpp
//
/////////////////////////////////////////////////////////////////////////////
//
//??Optimization?problem:
//??is?a?set?of?sites?（pixels）?of?width?10?and?hight?5.?Thus?number?of?pixels?is?50
//??grid?neighborhood:?each?pixel?has?its?left?right?up?and?bottom?pixels?as?neighbors
//??7?labels
//??Data?costs:?D（pixellabel）?=?0?if?pixel?//????????????:?D（pixellabel）?=?10?if?pixel?//????????????:?D（pixellabel）?=?0?if?pixel?>=?25?and?label?=?5
//????????????:?D（pixellabel）?=?10?if?pixel?>=?25?and?label?is?not??5
//?Smoothness?costs:?V（p1p2l1l2）?=?min（?（l1-l2）*（l1-l2）??4?）
//?Below?in?the?main?program?we?illustrate?different?ways?of?setting?data?and?smoothness?costs
//?that?our?interface?allow?and?solve?this?optimizaiton?problem

//?For?most?of?the?examples?we?use?no?spatially?varying?pixel?dependent?terms.?
//?For?some?examples?to?demonstrate?spatially?varying?terms?we?use
//?V（p1p2l1l2）?=?w_{p1p2}*[min（（l1-l2）*（l1-l2）4）]?with?
//?w_{p1p2}?=?p1+p2?if?|p1-p2|?==?1?and?w_{p1p2}?=?p1*p2?if?|p1-p2|?is?not?1

#include?
#include?
#include?
#include?
#include?
#include?“GCoptimization.h“


struct?ForDataFn{
	int?numLab;
	int?*data;
};


int?smoothFn（int?p1?int?p2?int?l1?int?l2）
{
	if?（?（l1-l2）*（l1-l2）?<=?4?）?return（（l1-l2）*（l1-l2））;
	else?return（4）;
}

int?dataFn（int?p?int?l?void?*data）
{
	ForDataFn?*myData?=?（ForDataFn?*）?data;
	int?numLab?=?myData->numLab;
	
	return（?myData->data[p*numLab+l]?）;
}



////////////////////////////////////////////////////////////////////////////////
//?smoothness?and?data?costs?are?set?up?one?by?one?individually
//?grid?neighborhood?structure?is?assumed
//
void?GridGraph_Individually（int?widthint?heightint?num_pixelsint?num_labels）
{

	int?*result?=?new?int[num_pixels];???//?stores?result?of?optimization



	try{
		GCoptimizationGridGraph?*gc?=?new?GCoptimizationGridGraph（widthheightnum_labels）;

		//?first?set?up?data?costs?individually
		for?（?int?i?=?0;?i?			for?（int?l?=?0;?l?				if?（i?					if（??l?==?0?）?gc->setDataCost（il0）;
					else?gc->setDataCost（il10）;
				}
				else?{
					if（??l?==?5?）?gc->setDataCost（il0）;
					else?gc->setDataCost（il10）;
				}

		//?next?set?up?smoothness?costs?individually
		for?（?int?l1?=?0;?l1?			for?（int?l2?=?0;?l2?				int?cost?=?（l1-l2）*（l1-l2）?<=?4????（l1-l2）*（l1-l2）:4;
				gc->setSmoothCost（l1l2cost）;?
			}

		printf（“\nBefore?optimization?energy?is?%d“gc->compute_energy（））;
		gc->expansion（2）;//?run?expansion?for?2?iterations.?For?swap?use?gc->swap（num_iterations）;
		printf（“\nAfter?optimization?energy?is?%d“gc->compute_energy（））;

		for?（?int??i?=?0;?i?			result[i]?=?gc->whatLabel（i）;

		delete?gc;
	}
	catch?（GCExcep