Determining graph sizes efficiently with F#


Introduction Continuing on with my gaming-in-F# post, this week's post is derived from this challenge. The initial challenge is, for each node, to determine the "efficiency" of a node within a network, that is, to calculate the maximum number of hops it takes to reach all edges of the graph starting from that node. So … Continue reading Determining graph sizes efficiently with F#

Advertisements

Tips on writing an EF-based ETL


I’ve been working on a relatively small ETL (that’s Extract-Transform-Load) process recently. It’s been written in C# using EF4 and is designed to migrate some data – perhaps a million rows in total – from one database schema to another as a one-off job. Nothing particularly out of the ordinary there; the object mapping is … Continue reading Tips on writing an EF-based ETL