C++ Deadlock Detection Program Help...

[coolsc81]

I am having a hard time constructing the following C++ program provided the following instructions:

Design a program that can detect deadlocks in a resource graph.

Your program should have a menu system with two options:

1. Construct a resource graph
2. Detect deadlocks
?
If user selects 1, you program should prompt for further inputs as followings.

Source:
Dest.:
More?

If user answer for More is ‘N’ then your program will go back to main menu. Otherwise continue adding more nodes to the resource graph.

When user selects 2, you start to search for a deadlock.

Your program should utilize the following data structure

struct node
{
char name;
node *next1;
node *next2;
};

If you detect a deadlock, you should print program will try to find a deadlock within the resource graph the content of L so that L contains the deadlock set.

Any help that you can provide me would be appreciated, thanks.

[Valmont]

What exactly is the problem? Do you need a container but don't know how to code it? Or do you want to know what a deadlock or a resource graph is?

What have you so far? Show it so I know what you are talking about.

[coolsc81]

Here is what I got so far... I need help with finishing the code and implementing it to a program.

Thanks for the help.

- Shawn


Sample code:

struct Node
{

char Name:
Node *next;

};

Node Graph[20];


// 1. Construct Resource Graph
// 2. Detect deadlock
// 3. Quit

// Source: A
// Destination: B
// More? If true:
// Source: B
// Destination: D
// ...
// ...
// More? If false:
// Execute Detection Algorithum

// ..

// print L = A , B , C , D , C

// index:

void Main()

{

indx = 0;
Menu;
switch(choice)
{
n 
case 1:

break;

case 2:

break;

}
}



// Case 1:

while (Ans != 'T')
{
node * S_Pointer, D_Pointer;
cout << "Source:";
cin >> source;
cout << "Destination:";
cin >> destination;


for(i=0; i<20; i++)
{


if ( Graph[i].Name == source)
{

SePointer = Graph[i].Name;
found = true;
}

if(!found)
{
S_Pointer = Graph[index];
index++;

}
}
}


// same for destination

::edited by sde, please use [ code] tags::