Chris Pollett > Students > Padmashali

    Print View

    [Bio]

    [Blog]

    [CS 297 Proposal]

    [Deliverable 1]

    [Netflix Recommender System - PDF File]

    [Deliverable 2]

    [Deliverable 3]

    [Deliverable 4]

    [CS 297 Report - PDF File]

    [CS 298 Proposal]

    [CS 298 Report - PDF File]

    [CS 298 Final Presentation Slides - PDF File]

























Max Flow Problem

The Maximum flow problem involves finding a feasible flow through a single-source, single-sink flow network that is maximum. I have tried to solve the maximum flow problem using two algorithms - Ford Fulkerson method and Push - Relabel algorithm. The implementation gives the maximum flow and also uses doctest module in python to test simple cases. The maximum network flow problem can be used to solve the bipartite matching problem. I will be developing a recommendation system for Yioop Groups and the bipartite matching can be used to map Yioop users to threads.

Push-Relabel Algorithm - Implementation of the push relabel algorithm. It asks for the graph input in the form of a text file and also asks for the number of nodes in the network.

Ford-fulkerson Algorithm - Implementation of the ford fulkerson algorithm. It asks for the graph input in the form of a text file.

Input.txt - Sample input file (graph).

Maximum Flow Presentation Presentation on Max Flow Problem - Ford Fulkerson and Push Relabel algorithm