Category Archives: D1

Decision mathematics 1

Algorithm Complexity

The complexity of an algorithm is a measure of the … read more

Dijkstra’s Algorithm

Dijkstra’s algorithm generates the shortest path tree from a given … read more

Shortest Route

The second problem that we will consider for networks is … read more

Prim’s Algorithm – Table Form

Prim’s algorithm is also suitable for use on distance tables, … read more

Prim’s Algorithm

Prim’s algorithm generates a minimum spanning tree for a network. … read more

Kruskal’s Algorithm

Kruskal’s algorithm finds the minimum spanning tree for a network. … read more

Minimum Connector

The minimum connector problem gives a way to join every … read more


A network is a graph in which each edge is … read more

Eulerian Graphs

A connected graph in which every vertex is of even … read more

Complete Graphs

A complete graph is a form of simple graph. Every … read more