351 بحث

Course Contents:

I.       Introduction

Graphs and Network Terminology

Examples of Networks



II.      The Shortest Path Problem

Bellman Algorithm

Dijkstra Algorithm

Bellman - Ford Algorithm



III.    Scheduling Optimization

Critical Path Method (CPM)

Program Evaluation and Review Technique (PERT)



IV.     The Maximum Flow Problem



V.      The Minimum Cost Flow Problem