Eulerian Study guides, Revision notes & Summaries

A summerisation of all the key topics of Further Decision A-Level (Both Yr1 and Yr2) which includes: - Bubble and Quick Sort - Key terms (a walk, path, Hamiltonian cycle, a tree etc) - Graphs (Simple, Directed, Complete, Isomorphic, Eulerian, Semi-Eulerian and Non-Eulerian) - Algorithms (Floyd's, Nearest Neighbour, Lower Bound, Prim's, Dijkstra's, Planarity, Route Inspection, Bin Packing and Tour Improvment) - The Simplex Method (normal way, two-stage and the Big-M Method) - Types...

This summary includes: graph theory, connected and disconnected graphs, isomorphic graphs, verticies and nodes, node degrees, edges and arcs, loops, multiple edges, paths and cycles, trees and forests, eulerian graphs, semi-eulerian graphs, subgraohs, spanning trees, kruskal's algorithm, prim's algorithm, quadratic complexity, adjacency matrix, prims from a table, djikstra's algorithm

useful note