Checklist

Introduction

• Use correct terminology for networks, such as node, edge, degree, weight, path, circuit and tree
• Draw and correctly label a network from a distance table

Traversability

• Determine whether a network is:
  • traversable from any node;
  • traversable from a specified node;
  • not traversable.
• Explain the conditions needed for each of the cases above.
• Describe a tour of the edges.
• Suggest suitable modifications to a network to make it traversable from any node.
• Suggest suitable modifications to a network to make it traversable from an specific node.

Minimum Spanning Tree

• Construct a minimum spanning tree.
• Construct a minimum spanning tree using a suitable algorithm.
• Construct a minimum spanning tree, with modifications to meet further constraints, such as:
  • avoiding specified nodes and/or edges;
  • using specified nodes and/or edges.

Shortest Path Methods

• Find the shortest path between two nodes.
• Find several possible paths between two nodes, and choose the shortest path from these.
• Demonstrate the use of an algorithm to find the shortest path.
• Find a shortest path, with modifications to meet further constraints, such as:
  • avoiding specified nodes and/or edges;
  • using specified nodes and/or edges.

Combination Methods

• Demonstrate a combination of these skills to solve a network problem in context.