Printing the contents of STL containers in a generic way
A generic Print functionA way of using STL algorithms combined with template functions as a means of printing the contents of any type of STL container (eg a std::vector), containing …
Month: July 2012
Kruskal’s Algorithm in C++
A simple C++ implementation of Kruskal’s algorithm for finding minimal spanning trees in networks. Though I have a previous posting that accomplishes exactly the same thing, I thought that a …
How to sort items contained in STL maps
By definition you cannot sort a std::map by value, since a std::map sorts its elements by key. This posting documents a way to get around this by dumping std::map key-value …
Modeling networks as graphs in C++
After playing around with some graph algorithm code as implemented by Sedgewick and others, I have come to the conclusion that while these are efficient and concise, improvements could be …
Finding substrings within strings using the Boyer-Moore-Horspool Algorithm in C++
Ever wondered what computer algorithm gets employed when using Ctrl-F to search for specific words in a page of text?
Creating sequence diagrams in Enterprise Architect
A few screenshots describing how to create sequence diagrams using Enterprise Architect. There is an excellent YouTube presentation, which is where I got a lot of this information from, available …
How to convert const_iterators to iterators using std::distance and std::advance
A short posting demonstrating how to remove the const-ness of a const_iterator, given that it is not possible to use re-casting along the lines of const_cast<> to convert from const_iterator …