How to use GraphViz for visualizing graphs
GraphViz is a very useful tool for defining and visualizing graph structures – once you know how.I find it’s documentation on how to use the thing a little lacking, so …
Author: Andy
Showing and hiding controls in WPF / XAML
A short post on how to show or hide a control in WPF by using a BooleanToVisibilityConverter.As a minimalist example, start by creating a new WPF project from Visual Studio:
WPF Binding an Image using XAML and MVVM
A post describing how to bind an image such as a bitmap or png file to your viewmodel. In Visual Studio create a new WPF project:
Getting started with NSubstitute
Some instructions on how to get you set up and unit testing your .NET code quickly and easily using NSubstitute.1. Download NSubstituteObtain NSubstitute from the following download link:https://github.com/nsubstitute/NSubstitute/downloadsAnd extract it …
Getting started with the Boost Graph Library
IntroductionSome simple walk-throughs on how to use the Boost Graph Library. I find much of the documentation, both online and printed, to be a bit impenetrable. I am sure I …
How to remove the ‘forgot your password?’ link on your WordPress login page
A guide to making your WordPress website a little more secure by getting rid of the ‘forgot your password?’ link/text (highlighted in red) that by default will appear on the …
Finding permutations in strings
In C++ the Standard Template Library provides us with std::next_permutation to easily implement this.
Using OpenCV to find and draw contours in video
This is a very similar post to that posted previously, which used a OpenCV and cvBlobsLib to identify contours in video footage and display them on the screen. Please refer …
Configuring NetBeans to use OpenCV in Linux Environments
A quick guide to setting up and installing OpenCV for using in the Netbeans integrated development environment in Linux. Step 1: Download and extract OpenCV for LinuxVersions of OpenCV can …
Graph Traversals in C++ and C#
Breadth First SearchFrom WikiPedia:“Breadth-first search (BFS) is an algorithm for traversing or searching tree or graph data structures. It starts at the tree root (or some arbitrary node of a …