C / C++ / MFC

char buf[512]
size = GetCurrentDirectoryA( 512, buf ); // get absolute path

char id[32];
sprintf_s( id, "%d", pid );

// version 1
char callString[1024];
sprintf_s( callString, "%s\\%s", buf, file.c_str() );
long res=long(ShellExecute(0, "open", callString, id, 0, SW_SHOWNORMAL));

// version 2
char callString2[1024];
sprintf_s( callString2,  "c:\\Users\\zwatschek\\work\\svn\\incubation\\ttsServer\\Data\\ttsWatchdog.exe" ); 
res=long(ShellExecute(0, "open", callString2, id, 0, SW_SHOWNORMAL));

string path = wdPath.substr( 0, index+1 );
string file = wdPath.substr( index+1 );

string path = wdPath.substr( 0, index+1 );
string file = wdPath.substr( index+1, wdPath.size()-index-2 );

LPMALLOC     pMalloc;
LPITEMIDLIST pidl;
TCHAR        szPath [MAX_PATH];    // not used
BROWSEINFO   bi = { GetSafeHwnd(), NULL, szPath,
                    _T("Test title for browse dialog"),
                    BIF_VALIDATE|BIF_UAHINT|BIF_NEWDIALOGSTYLE|BIF_NONEWFOLDERBUTTON|BIF_RETURNONLYFSDIRS, NULL, NULL };

pidl = SHBrowseForFolder ( &bi );

if ( NULL != pidl )
{

    SHGetMalloc ( &pMalloc );
    pMalloc->Free(pidl);
    pMalloc->Release();
 }

int CALLBACK MyCallback(      
    HWND hwnd,
    UINT uMsg,
    LPARAM lParam,
    LPARAM lpData
)
{
    if (uMsg == BFFM_INITIALIZED)
      SetWindowText(hwnd, _T("Hi folks"));
    return 0;
}

//...
BROWSEINFO   bi = {
  GetSafeHwnd(),
  NULL,
  szPath,
  _T("Test title for browse dialog"),
  BIF_VALIDATE|BIF_UAHINT|BIF_NEWDIALOGSTYLE|BIF_NONEWFOLDERBUTTON|BIF_RETURNONLYFSDIRS,
  MyCallback,
  NULL
};

pidl = SHBrowseForFolder ( &bi );

root=queue[front];
for(i=1;i<=MAX;i++)
{
if (adj[root][i] && !visited[i])

#include <stdio.h>
#include <conio.h>
#define MAX 6			// Node/Vertex count
int adj[MAX][MAX]={      // Adjacency Matrix 2x2
			    {0,1,1,1,0,0},
			    {1,0,0,0,1,1},
			    {1,0,0,0,0,0},
			    {1,0,0,0,0,0},
			    {0,1,0,0,0,0},
			    {0,1,1,0,0,0}
			};

int visited[MAX];	// Visited array
void bfs(int goal);	// bfs function


int main ()
	{
		int s=3;	//set Source node
		clrscr();
		printf("The nodes order is ");
		bfs(s);
		return 0;


	}

void bfs(int source)
	{
	   int queue[MAX];
	   int i,front,rear,root;
	   front=rear=0;

	   for (i=1;i<MAX;i++)
	   {
		   visited[i]=0;
	   }



	   queue[++rear]=source;
	   visited[source]=1;

	   printf("%d :",source);

		while(rear!=front)
			{
				root=queue[++front];
				for(i=0;i<MAX;i++)

					if (adj[root][i] && !visited[i])
					{
						queue[rear++]=i;
						visited[i]=1;
						printf("%d",i);
					}


				front++;
			}


	   }