Category: C++ / MFC / STL
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 …
In C++ the Standard Template Library provides us with std::next_permutation to easily implement this.
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 …
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 …
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 …
An excellent implementation of the Simplex algorithm exists over at Google Code, written by Tommaso Urli:https://code.google.com/p/cpplex/Implemented as class library, it relies on no other dependencies other than the C++ Standard …
Some instructions and screenshots to help you get up and running using the Fast Light Toolkit (FLTK) within the NetBeans development environment in Linux. For configuring FLTK in Visual Studio …
I like using NetBeans for C++ development within Linux environments.Sometimes a gotcha can occur when trying to use the following declaration: You may wish use this in order to utilize …
A Hamiltonian path in a graph is a path whereby each node is visited exactly once.A number of graph-related problems require determining if the interconnections between its edges and vertices …
An example demonstrating how to create and display a tab common control using WinAPI (Win32) C++ programming. Much credit needs to go to Ken Fitlike’s excellent WinAPI site, from which …