Traversability
Euler
Shortest Path
Spanning Trees
Network Diagrams
100
The degree of the node is
how many lines connect to it
100
Who is Euler?
the founder of networks
100
What is the "shortest path" of a network?
the minimum distance or time it takes to get from start to end
100
Is this a tree?
yes
100
What is an edge?
line
200
What does it mean to be traversable?
Can trace the entire network once and only once without lifting your pen
200
the variable that reprsents Euler's number is the letter...
e
200
which algorithm do we use to find shortest path?
Dijkstra's
200
Is this a tree?
no
200
what is a node?
dot
300
Two odd nodes or all even nodes mean
the network is traversable
300
What's the difference between an Euler Path and an Euler Circuit?
path- two odds as start and end points
circuit- all even
300
What is the first step to using Dijkstra's algorithm?
start at the start, and look for everywhere you can go
300
Which algorithm helps us find a minimum spanning tree?
Kruskal's
300
what is the weight?
number?
400
All even nodes imply the network is
a circuit
400
Which bridge prompted the discovery of graph theory?
Konigsberg
400
What is the working out that needs to be shown when finding the shortest path?
The sums of distances up that point and the crossout of larger distances
400
What is the first step of Kruskal's algorithm?
Put the edges in order from smallest to biggest
400
What is a network?
A diagram of anything interconnected (anything along those lines... no pun intended)
500
Two odd nodes imply the network is
a path
500
How can we make a non-traversable network, traversable?
delete or add an edge
500
Explain Dijkstra's Algorithm.
It works by maintaining a set of visited nodes and a set of unvisited nodes, iteratively selecting the unvisited node with the smallest tentative distance to explore its neighbors
500
How do you know when you're done?
Only circuits are created, or each node is connected in the tree
500
How do we dram a network from a table
acceptable explanation