There are lots of topics in both practical and theoretical computer science that deal with graphs, lots of different kinds of graphs, lots of ways to represent a graph as a data structure, and lots of operations you’d want to perform on such a data structure. 955 more words

## Tags » Csharp

#### Producing combinations, part five

Previously we enumerated all the combinations of a particular size from a sequence by observing that the sequence `{50, 60, 70, 80, 90}`

had combinations of exactly three elements as follows: 814 more words

#### Introduction

Oh, Hello There! I didn’t see you come in… Welcome to my blog, a blog about software, web, mobile development and my own personal ramblings about what it is like to be a software dev in the real world. 316 more words

#### Violating the "smart enum" pattern in C#

For a while now, I’ve been a big fan of a pattern in C# which mimics Java enums to a certain extent. In general, it’s a lovely pattern. 1,469 more words

#### Producing combinations, part four

Last time I showed how to use an immutable stack of Booleans to act as flags indicating whether a particular element of a sequence should be chosen as one of the combinations of exactly k elements. 509 more words

#### Ultrafast JSON Parsing

Download the code on Github

I previously blogged about parsing JSON using JSON.NETâ€™s JsonTextReader, during which I touched on a key point; the Large Object Heap, and why to avoid it. 1,174 more words

#### Producing combinations, part three

All right, we have an immutable stack of Booleans and we wish to produce all such stacks of size n that have exactly k true elements. 728 more words