See what we can offer to your school
"SimpleStudy just makes sense...”
Get the best plan for your school
12 questions from this quiz
Nodes and edges
How many edges meet at that node
Twice the number of edges
Moving along nnn edges, can revisit nodes
All nodes visited are different
A path that starts and ends at same vertex
An edge from node iii to node jjj
Number of walks of length nnn
Connected graph with no cycles
n−1n-1n−1 edges
Start at any node in the graph
Prim's builds locally, Kruskal's globally
Select your subjects, and get access to A+ resources today.