Why Experts Exchange?

Experts Exchange always has the answer, or at the least points me in the correct direction! It is like having another employee that is extremely experienced.

Jim Murphy
Programmer at Smart IT Solutions

When asked, what has been your best career decision?

Deciding to stick with EE.

Mohamed Asif
Technical Department Head

Being involved with EE helped me to grow personally and professionally.

Carl Webster
CTP, Sr Infrastructure Consultant
Ask ANY Question

Connect with Certified Experts to gain insight and support on specific technology challenges including:

Professional Opinions
Ask a Question
Did You Know?

We've partnered with two important charities to provide clean water and computer science education to those who need it most. READ MORE

troubleshooting Question

A shortest path algorithm and Maximum-flow problem

Avatar of Shailesh1064
Shailesh1064 asked on
Math / Science
4 Comments1 Solution925 ViewsLast Modified:
Hi, Anyone can have any idea or specific information how to design the  shortest path algorithm and also Maximum-flow problems as shown below please?
[1] Suppose that A is a matrix where A[i,j] is the length of a shortest path between vertices i and j in an undirected, weighted graph G with n vertices (all weights are positive). Design an algorithm that takes O(n2) time to update A when an additional edge is inserted into G.

[2] Dining problem. Several families go out to dinner together. To increase their social interaction, they would like to sit at tables so that no two members of the same family are at the same table. Show how to find a seating arrangement that meets this objective (or prove that no such arrangement exists) by reducing this problem to the maximum-flow problem. Assume that there are p families and q tables; the i-th family has ai members, the j-th table has a seating capacity of bj.
Avatar of NovaDenizen

Our community of experts have been thoroughly vetted for their expertise and industry experience.

This problem has been solved!
Unlock 1 Answer and 4 Comments.
See Answers