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 I’ve posted some instructions on how to get started. For Windows operating systems, download and install the GraphViz programmer from here: https://www.graphviz.org/download/

Graph Traversals in C++ and C#

Breadth First Search From 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 graph, sometimes referred to as a ‘search key’) and explores the neighbor nodes first, before moving to the next level neighbors” I have …

Continue reading ‘Graph Traversals in C++ and C#’ »