# Graph Theory

## Calculating max-flow using push-relabel method

Calculating maximum flow in a flow-network is a fundamental problem. It has been observed that smart implementation of ‘push-relabel’ methods performs better than algorithms based on finding ‘augmenting paths’. We have implemented one such variation of push-relabel method. It is known as ‘relabel to front’ algorithm. It is discussed in details in ‘Introduction to algorithms’ …

## Getting caught in a loop while traversing a (directed acyclic) graph

How to detect if you are getting caught inside a loop when you are traversing a directed graph. This is equivalent of checking if you graph is a Directed Acyclic Graph (DAG). Assume that each vertex of graph has a label such as A, B, C, etc. While you are traversing the graph, you keep …

## Snakes : Python library for petri nets

It looks promising and cool. Snakes is a Python library for working with Petri-nets. I am playing around with it so can’t say much about it right now. Here is some blogs about it by its author. It is hosted on google-code. A long list of petri-nets related tools is available here. Some of them …

## Checking plagiarism in assignment (tested with VHDL language)

I have developed some python scripts available here. I have used them in EE705 (VHDL, verilog) and found them very useful. It generates detailed log (which file matches which file) and sent emails to offenders with an archive of all file which were matched. It is integrated with my moodle-application (automatic download, extract, compare, sending-emails.) …

## Notes : Graph and Linear Systems in Laplacian Matrix

I have collected information regarding latest progress made in solving of system of Linear Equations. Interestingly this works uses spanning tree (approximate) in solving Linear Equations. Its was amazing that tree has to do anything with system of linear equations . See the attached beamer. Apparently they claim that they have found the fastest algorithm. …

Scroll to Top