I do .NET for living and try to write code I am not be ashamed of :) ...

I do .NET for living and try to write code I am not be ashamed of :) ...

Abstract: Graph algorithms are always complex and difficult to deduce and prove. In this paper, the Floyd-Warshall algorithm is deduced and formally proved. Firstly, the problem specification is ...

Floyd Warshall Algorithm implemented in C language for finding shortest path between all nodes in a graph represented in Matrix form ...

The program solves the next task: you need to transport ants from start to end of the graph. The program makes in the most optimal way.

Abstract: Evacuation route is very important for the community especially those who are living in disaster-prone areas since the route used to perform the evacuation to evacuate from the place of the ...

ABSTRACT: Improved gray-scale (IGS) quantization is a known method for re-quantizing digital gray-scale images for data compression while producing halftones by adding a level of randomness to improve ...