Description

 

 

 

 

1.Main Titles

1^st Choice:

Maximum Flow and Dijkstra Algorithms.

2^nd  Choice:

Maximum Flow and Moore Algorithms.

 

 

 

2. Project/Task Input Description Given a well-known graph, which has:
3. A set of vertices: V₁, V₂, V₃, … , V_n .
4. A set of Edges: e_ij connecting the two vertices V_i, and V_j .

• The weight concerned with each edge.

1. One Vertex is distinguished as a source, and another as a destination.

 

 

3.Project Requirements and Restrictions

1. Full analysis, design, implementation, and testing of only one

of the two choices, indicated above.

1. The source code and clear Pseudo Code must be provided.

iii. An extremely Friendly GUI must be available.

1. No restrictions on the implementation programming language.

 

 

Design and Analysis of Algorithms. Final Project      Good   1  Luck      Dr. Eng. Moustafa Reda A. Eltantawi

 

1. Complete documentation describing the SW life Cycle of the concerned task, including:
   1. Cover page, describing:
      • University and Faculty Logos.
      • The project title.
      • Department name.
      • Student(s) nams(s).
      • Student(s) Id(s).
      • Student(s) National-Id(s).
      • Student(s) E-mail(s).

 

1. Introduction, including: A visibility Study and short description of the task to be achieved.

 

1. Precise analysis and design phases supported by illustrative flow-diagrams, charts, snapshots,…

 

1. Accurate implementation.

 

1. Full discussion of the outputs graphs, with the ability to show it step-by-step. The original input graph must be drawn as a first step.

 

1. Clarified Conclusions with clear and honest pros and cons for the achieved task.

 

1. Suggestions for related future work.

 

1. The references must be listed in the order: Author(s) name(s), Research/book title, Publisher, year of publishing.