# Archive | D1

## Binary Search Algorithm

This only applies to a list of names in alphabetical order or a list of numbers in increasing order. Unordered lists would have a sorting algorithm applied first. This algorithm concentrates on the midpoint of an ever reducing list. We define the midpoint of a list of N names, numbered N1, N1+1,…,N2 as [(N1+N2)/2] where […]

## Rules for Drawing Activity Networks

An activity network is a graphical representation of activities and events that are needed for a process. There are several rules that have to be obeyed when creating accurate networks. These rules are: An edge is used to represent an activity. A vertex represents an event, which is the start or end of one or […]

## Prim’s Algorithm in Table Form

Prim’s algorithm for the minimum spanning tree has an equivalent table algorithm. This is useful for large problems where drawing the network diagram would be hard or time-consuming. Prim’s table algorithm has the following steps. Choose a starting vertex. Cross out the row corresponding to this node. Label the column corresponding to this node (1). […]

## Prim’s Algorithm – Finding the Minimum Spanning Tree

We apply this algorithm to assemble a “minimum spanning tree”. Suppose we have a network of roads, where each road connects two town. Some of the roads may be redundant, in that for any two towns, you could go from one town to the other by two different routes, in which case one of the […]

## Eulerian Graphs

An Eulerian graph is a connected graph in which every vertex is of even degree. A property of Eulerian graphs is that they can be completely traversed, returning to the start point without following any edge more than once or lifting pen from paper. Note that an Eulerian graph may not be simple – so […]

## Graphs

Relationships between quantities or objects occur in various ways. A very familiar example is where an equation exists to express one quantity in terms of the other. We can find a set of points satisfying the equation and display the relationship on a graph. For instance, the amount of radioactive material A in a sample […]