#TITLE_ALTERNATIVE#
Abstract: <br /> <br /> <br /> <br /> <br /> A network is a type of directed graphs with two distinguished vertices, a source and a sink. Every arch on a network has a weight, which is called capacity. In <br /> <br /> <br /> <br /> <...
Saved in:
| Main Author: | |
|---|---|
| Format: | Final Project |
| Language: | Indonesia |
| Online Access: | https://digilib.itb.ac.id/gdl/view/5909 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Institution: | Institut Teknologi Bandung |
| Language: | Indonesia |
| Summary: | Abstract: <br />
<br />
<br />
<br />
<br />
A network is a type of directed graphs with two distinguished vertices, a source and a sink. Every arch on a network has a weight, which is called capacity. In <br />
<br />
<br />
<br />
<br />
network we are interested in finding a maximum flow from the source to the sink. <br />
<br />
<br />
<br />
<br />
The Ford Fulkerson algorithm can be used to find a maximum flow in a network. In this final project we study scheduling problem in high schools. A network is <br />
<br />
<br />
<br />
<br />
constructed so that it can represent the scheduling problem. A maximum flow obtained on this network represents a school timetable. <br />
<br />
<br />
<br />
<br />
As a part of this final project, we build a computer program to generate school timetables. This program is constructed based on the Ford Fulkerson algorithm. <br />
|
|---|