Get ahead with a $300 test prep scholarship
| Enter to win by Tuesday 9/24
Decision - Graphs
Terms in this set (12)
Complex disconnected graph
This graph contains loops or repeated edges and it is impossible to find a spanning tree for it.
Simple connected graph
This graph contains no loops or repeated edges and it is possible to find a spanning tree for it.
Vertex and edge
The graph consists of vertices connected by edges. A connected graph with N vertices has N-1 edges in its minimum spanning tree.
A single continuous route connecting a number of vertices together that doesn't revisit any vertex or reuse any edge.
This is a path which returns to the starting vertex.
This is a path which visits all vertices and returns to the starting vertex.
A graph whose vertices all have an even degree is this type of graph.
This is what we call a graph with weights on its edges.
Degree of a vertex
The number of edges going to a vertex determines this property of the vertex.
The optimum way of visiting each vertex and returning to the start is the solution to this problem.
The optimum way of travelling along each edge and returning to the start is the solution to this problem.
Kruskal's or Prim's
These algorithms are used to find the minimum spanning tree of a network. Both are "greedy" algorithms that always work for a connected graph.