I know that
Through Everything
Jumping on Tables
Speedy Gonzales
100
What is the thing the red arrow is pointing to called?
Node
100
A network that can start at one node and trace every edge exactly once is called what?
Traversable
100
How many nodes are in this network?
5
100
What is the shortest route from this network and what is its weighted value?
A --> C --> F --> G
Weight value: 32
200
What are the lines that connect nodes called?
Edges
200
Is this network traversable?
No
200
What is the missing value in this table?
33
200
How long does it take to travel from node B to node E?
10 minutes
B -->(4) F -->(3) A -->(3) E
300
Is this a path or a circuit?
Circuit
300
How can this traversable path be written? (i.e. A - B - C - ...)
Anyway, as long as you visited 9 nodes and started on D and finished on E or vise-versa
EXAMPLE: D - E - C - B - D - C - A - B - E
300
What is the value of the edge that connects Node E and Node D?
18
300
What is the minimum distance you have to travel to get from Westport to Christchurch?
335km
400
What is the degree of Node A?
6
400
If you were to following a Euler Path starting from Node G, what node will you finish on?
Node C
(Start on an odd node, finish on the other odd node)
400
What is the missing value?
56
400
If each edge is 2m long, how long is the traversable circuit?
36m
(18 edges)
500
A network is only traversable if...?
(Two answers)
It has 2 odd nodes or 0 odd nodes
500
What two nodes can you connect with another edge to make this network traversable?
Any edge that connects any of the following nodes:
Library, Languages, Science, and Technology
500
What value is missing from the table and what nodes does it connect?
15, Node C --> Node E
500
Draw a tree diagram with three different paths you can take to get from E to A to determine the shortest path.
