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#
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
Let there be LINQ
Just a quick post regarding use of the let keyword in LINQ, which I find to be somewhat under-used by many people. Whilst one benefit of it can be readability (i.e. aliasing sections of complex queries to aid understanding of the query), the other benefit can be performance. There is indeed a cost associated with … Continue reading Let there be LINQ
The Cockney Coder 