QuestionQuestion

Write a program which can implement the Gale-Shapely algorithm for finding a stable maximum matching in a complete bi-partitie graph. The program will need to be able to handle a small size input, a medium size input, and a large size input as well.

This is some sample input:
3
2 1 3
3 2 1
1 3 2
2 1 3
3 2 1
1 3 2
2
1 2
1 2
2 1
2 1
0

This is some sample output:
Instance 1:
2
3
1
Instance 2:
2
1

Solution PreviewSolution Preview

This material may consist of step-by-step explanations on how to solve a problem or examples of proper writing, including the use of citations, references, bibliographies, and formatting. This material is made available for the sole purpose of studying and learning - misuse is strictly forbidden.

public class CompleteBipartiteGraph {
private int numberOfPairs;
private Vertex[][] vertices;
private int edges[][][];

//constructor
public CompleteBipartiteGraph(int numOfPairs)
{
numberOfPairs = numOfPairs;
vertices = new Vertex[2][numberOfPairs + 1];
for (int i = 0; i < 2; i++)
{
for (int j = 1; j < numberOfPairs + 1; j++)
{
vertices[i][j] = new Vertex();
vertices[i][j].number = j;
}
}
edges = new int[2][numberOfPairs + 1][numberOfPairs];
}...
$45.00 for this solution

PayPal, G Pay, ApplePay, Amazon Pay, and all major credit cards accepted.

Find A Tutor

View available Data Structures and Algorithms Tutors

Get College Homework Help.

Are you sure you don't want to upload any files?

Fast tutor response requires as much info as possible.

Decision:
Upload a file
Continue without uploading

SUBMIT YOUR HOMEWORK
We couldn't find that subject.
Please select the best match from the list below.

We'll send you an email right away. If it's not in your inbox, check your spam folder.

  • 1
  • 2
  • 3
Live Chats