A+ » VCE » Further Maths U3 & 4 Master Notes » OA2 Networks and Decision Mathematics » FM Traversable Graph

FM Traversable Graph

2.1 Introduction to Walks

Walks

  • A walk is a sequence of edges linking connected vertices in a graph.
  • Walks can have repeated vertices and edges.
  • Walks can be denoted in a written form by listing the vertices, in order, with a dash between each.
  • Walks are shown graphically as a continuous line along each relevant edge. Arrows are placed along the line to show direction.

Example

The walk A-C-D-A-C is shown in the below graph:

Connected Graph

Read More »2.1 Introduction to Walks