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

Networks

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


Fatal error: Uncaught Error: Call to undefined function ereg() in /homepages/45/d116745460/htdocs/shelswell.org.uk/wp-content/plugins/wpmathpub/phpmathpublisher/mathpublisher.php:1604 Stack trace: #0 /homepages/45/d116745460/htdocs/shelswell.org.uk/wp-content/plugins/wpmathpub/phpmathpublisher/mathpublisher.php(1625): detectimg('e249a6ebf273917...') #1 /homepages/45/d116745460/htdocs/shelswell.org.uk/wp-content/plugins/wpmathpub/phpmathpublisher/mathpublisher.php(1661): mathimage('r', '12', 'http://teaching...') #2 /homepages/45/d116745460/htdocs/shelswell.org.uk/wp-content/plugins/wpmathpub/wpmathpub.php(110): mathfilter('<m>r</m>', '12', 'http://teaching...') #3 [internal function]: wpmathfilter(Array) #4 /homepages/45/d116745460/htdocs/shelswell.org.uk/wp-content/plugins/wpmathpub/wpmathpub.php(124): preg_replace_callback('#\\[pmath(\\s+siz...', 'wpmathfilter', 'A complete grap...') #5 /homepages/45/d116745460/htdocs/shelswell.org.uk/wp-includes/class-wp-hook.php(286): to_phpmath('A complete grap...') #6 /homepages/45/ in /homepages/45/d116745460/htdocs/shelswell.org.uk/wp-content/plugins/wpmathpub/phpmathpublisher/mathpublisher.php on line 1604