Maximum s-t Network Flow Algorithms

Recently, at one of the course at Boğaziçi University, we learned maximum s-t flow algorithms. One of the challenging part is to understand these algorithms and make them work on a sample graph. I guess that I can able to solve these algorithms on a given graph. Since the web lacks of the example run of both three algorithms; Capacity Scaling Algorithm, Edmond's Karp Algorithm and Ford Fulkerson Algorithm, I decided to post this message to the interested people.

This is the sample run of both of the three algorithms, I will be happy if the figures are helpful,

Complex Systems Presentation

Recently, I am taking a course at Bogaziçi University, called Complex Systems. It is a graduate course and each week we present a paper the lesson. This is my last presentation, a review paper from Nowak et al. 2002. This paper explains both combinational and evolutionary aspects of language. The definition of language is investigated using formal language theory, learning theory and evolutionary dynamics. It is really interesting and maybe must be read paper on the area of language dynamics.

Here is the presentation document via issue.com

3D hierarchical drawing

Recently I am working on Irrlicht 3D Engine. The engine is so simple so that I can modify one of their sample code in order to partially 3d drawing of hierarchical layout. The results for the first time seems to be good and I decided to work on this.

I put the mountain view at the back of the view and it is really interesting.

Here are sample screens from the first code of mine at this engine

Random Walk

I am following a course at Bogazici University. I did a random walk in 2D simulation using leda C++ library again. By the way this library is perfect when you learn some basic data types you can do most of your computer science homeworks.

Here is some screens and final stats,