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

Pages in this set

Page 1

Preview of page 1
D1


Definitions

Page 2

Preview of page 2
D1
Graph
A graph G consists of vertices connected

Page 3

Preview of page 3
by arcs.

Page 4

Preview of page 4
D1
Subgraph
A subgraph of G consists of vertices of G
connected by arcs which belong to G.

Page 5

Preview of page 5
D1
Weighted graph
A weighted graph has values assigned to
its arcs.

Page 6

Preview of page 6
D1
Degree/valency
The number of arcs indecent to a vertex.

Page 7

Preview of page 7
D1
Path
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.

Page 8

Preview of page 8

Page 9

Preview of page 9
D1
Cycle
A closed path.

Page 10

Preview of page 10
D1
Connected graph
A graph is connected when all vertices
are connected.

Comments

No comments have yet been made

Similar Mathematics resources:

See all Mathematics resources »

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!

  • Created by: theoinkk
  • Created on: 08-06-15 12:47

Pages in this set

Page 1

Preview of page 1
D1


Definitions

Page 2

Preview of page 2
D1
Graph
A graph G consists of vertices connected

Page 3

Preview of page 3
by arcs.

Page 4

Preview of page 4
D1
Subgraph
A subgraph of G consists of vertices of G
connected by arcs which belong to G.

Page 5

Preview of page 5
D1
Weighted graph
A weighted graph has values assigned to
its arcs.

Page 6

Preview of page 6
D1
Degree/valency
The number of arcs indecent to a vertex.

Page 7

Preview of page 7
D1
Path
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.

Page 8

Preview of page 8

Page 9

Preview of page 9
D1
Cycle
A closed path.

Page 10

Preview of page 10
D1
Connected graph
A graph is connected when all vertices
are connected.

Comments

No comments have yet been made