## Kruskal’s Algorithm in C++

TweetA 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 simple implementation would be useful, one using a straightforward Graph … Continue reading

## Modeling networks as graphs in C++

TweetAfter 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 made to their usability. After studying Sedgewick’s books and online … Continue reading

## The K-Shortest Paths Algorithm in C++

TweetIntroduction Following on from a previous post which was concerned with finding all possible combinations of paths between communicating end nodes, this algorithm finds the top k number of paths: first the shortest path, followed by the second shortest path, … Continue reading

## Implementing Dijkstraâ€™s Algorithm using Sedgewick’s C++ Code

TweetIntroduction Dijkstra’s algorithm solves the shortest path problem for a graph with nonnegative edge weights, producing a shortest path tree. This algorithm is often used in routing and as a subroutine in other graph algorithms, the k-shortest paths algorithm, for … Continue reading

## A Recursive Algorithm to Find all Paths Between Two Given Nodes

TweetProblem Outline This I tackled previously when working on the design and implementation of routing optimization algorithms for telecommunications networks. Given that a wide area network with nodes and interconnecting links can be modelled as a graph with vertices and … Continue reading

## Implementing Kruskal’s Algorithm in C#

TweetThis post is essentially a blatant lifting of Omar Gamil’s CodeProject article on the same subject. I have been using the project as means of getting into C# programming and using things like Windows Forms etc in Visual Studio environments … Continue reading

## Finding Minimal Spanning Trees using Kruskal’s Algorithm in MFC / C++ / Boost libraries

TweetKruskal’s algorithm is used to find the minimal spanning tree for a network with a set of weighted links. This might be a telecoms network, or the layout for planning pipes and cables, or one of many other applications. It … Continue reading