Finite Mathematics Quiz
8 questions · no time limit
0:00
LOGIC, SETS, AND NETWORKS
Question 1 of 8
No time limit
Current
Answered
Flagged
Not seen
In applying Kruskal's algorithm to a weighted graph, an edge of weight w is rejected (not added to the spanning tree). What can be concluded about this edge?
YOUR PROGRESS
8
QUESTIONS
Ready when you are
Answer in any order. Your progress shows here as you go.
QUESTIONS
KEYBOARD
Pick an answer ABCD
Next question ↵→
Previous ←
Flag for review F
Answers save as you go · flagged questions come back at the end