scribeGriff Studios

Let's apply our DirectedGraph class to one of the most well known of graph algorithms - Kosaraju's algorithm for finding strongly connected components of a directed graph. The algorithm performs two passes of a depth first search (DFS) - the first on a directed graph will all arcs reversed and the second on the original graph. The second DFS discovers the strongly connected components by traversing the nodes in the original graph in the reverse order of their finishing times returned by the first DFS on the transformed graph.

I've always been rather fascinated by the concept that just about any signal can be decomposed into a weighted collection of elementary basis functions. My undergraduate linear systems professor would refer to these basis functions as CCFSs (cleverly chosen fundamental signals). But what makes a basis function cleverly chosen?

Getting distracted building a tabbed panel feed reader in Dart using AJAX, JSON and CORS was a lot of fun. The RSS feed from this blog is accessed using an HttpRequest and then CORS is used for displaying which projects on Github I'm watching. The two feeds are then packaged into a small tabbed panel widget and compiled to JavaScript. This allows it to be embedded into a web page and viewed with any modern browser.

The ability to determine time of day, the date, or to calculate elapsed time is just one of several fundamental capabilities to be found in just about every modern programming language. We frequently need to answer the question "when did this event happen?" or "how long has it been since this other event happened?". Dart's time keeping methodology is divided among the Stopwatch, DateTime and Timer classes.

An exception is an event, which occurs during the execution of a program, that disrupts the normal flow of the program's instructions. When an error occurs during the execution of a program, an error object, called an exception object, is created. The creation of this object is known as throwing an exception.