Decision 1 Algorithms & Definitions

A short guide I created for Decision 1. It includes all algorithms and definitons relevant to the Edexcel spec.

Definitons haven't came up on a paper for a while. That's either a sign that they're overdue or simply not being focussed on.

Nevertheless, they're there. The sections on the algorithms assume you're comfortable with the terminology used in Decision 1.

A lot of the algorithms in D1 simply need practice. Matchings will eventually become second-nature. Route inspection will get easier. Practice, practice, practice!

Good luck everyone!

HideShow resource information
  • Created by: theoinkk
  • Created on: 08-06-15 12:47
Preview of Decision 1 Algorithms & Definitions

First 4 words of the document:

D1 Definitions

Other pages in this set

Page 2

Preview of page 2

Here's a taster:

A graph G consists of vertices connected by arcs.…read more

Page 3

Preview of page 3

Here's a taster:

A subgraph of G consists of vertices of G connected by arcs which belong to G.…read more

Page 4

Preview of page 4

Here's a taster:

Weighted graph
A weighted graph has values assigned to its arcs.…read more

Page 5

Preview of page 5

Here's a taster:

The number of arcs indecent to a vertex.…read more

Page 6

Preview of page 6

Here's a taster:

A finite sequence of edges such that the end vertex of one edge is
the start vertex of the next. No vertex should appear more than once.…read more

Page 7

Preview of page 7

Here's a taster:

A closed path.…read more

Page 8

Preview of page 8

Here's a taster:

Connected graph
A graph is connected when all vertices are connected.…read more

Page 9

Preview of page 9

Here's a taster:

A digraph is where direction is assigned to arcs.…read more

Page 10

Preview of page 10

Here's a taster:

A connected graph with no cycles.…read more


No comments have yet been made

Similar Mathematics resources:

See all Mathematics resources »See all resources »