Binary relations and closures
I have made a little tool. Here you can specify some binary relation over a finite set. Then you can generate a closure of it.
I have made a little tool. Here you can specify some binary relation over a finite set. Then you can generate a closure of it.
Today I woud like to show you a remake of my previous flash app, which I rewrote into HTML5. It is the force-based graph algorithm form my previous article.
In this article we will see how to implement some basic geometry functions in 2D space. We will wirte line segment intersection and circumcircle.
In today's article I will introduce you my own small library for generating Voroni diagram in ActionScript 3. I used Fortune's algorithm, which is probably the fastest algorithm for solving Voronoi diagram.
Today we will learn how to implement the Aho-Corasick algorithm. It is used for finding occurences of words in text and it is faster than other common algorithms. Code will be in ActionScript 3, but implementation in C, C++, C# or Java will be very similar.