Show:
Matrix
Weighted Graphs
Visibility Matrix
Row Sums
Toolkits
100
What points are visible from point B?
A, B, C, I
100
If a bear is 222.45 feet away at point E do you think it is in range to hit point E?
yes the bear is in range
100
Which of the points A-F would you place a single fire observation tower so you can see most terrain?
Place a point at F
100
How do you get row sums?
Add up the rows
100
What is a circuit?
a path that starts and ends at the same vertex with out repeating.
200
Where would you put a fire tower that could see every point?
point (H, B)
200
What is the fewest number of relay towers you need to get from A-D?
3
200
Can you see point B from point D?
no you cant see point B
200
What is the highest row sums?
G, and H have the same amount with 7
200
What is a minimal spanning tree?
Connected graph with minimum total length that includes every vertex without and circuits.
300
What terrian would let you see all the points?
it would have to be a flat terrian
300
What is the shortest path?
A-B-C-G-E-D
300
What is the lowest row sums?
the lowest is B with 4
300
What is a distance matrix?
Display of distance from vertex of a minimal spanning tree.
400
What is a visibility matrix?
a graph that shows visibility of two point that are conected to eachother
400
If the shortest path goes from A-B-C-G-E-D what is the number of miles total to get through the whole circuit?(stopping at D)
10
400
Compute the slope of the line containing points D and C?
-301.4 feet
400
what is the total row sums from A-I?
49
400
what does shortest path mean?
shortest distance between 2 points.
500
What does the cell mean?
that the two points are visible to eachother
500
What is the circuit associated with? (euler circuits, shortest paths and hamiltonian circuit)
shortest path and hamiltonian circuit
500
what point A-F would be the best point to go to if you wanted to see the rest of the points?
point f because it is the highest
500
what does GIS stand for?
geographical information system
500
what is the hamiltonian circuit?
starts and ends at the same vertex and visits each vertex once.