10290703
Descripción
Fichas por Ezra Dorland, actualizado hace más de 1 año
|
Creado por Ezra Dorland
hace más de 6 años
|
|
| Pregunta | Respuesta |
| Define Graph | A collection of vertices connected by arcs |
| Define subgraph | A part of a graph |
| What is also a type of subgraph? | One that has all vertices but not all arcs |
| Define cycle | A closed path where the end vertex of the last arc is the start vertex of the first arc |
| Define tree | a connected graph with no cycles |
| Define weight | A property arcs may have e.g. cost, distance |
| Define minimum spanning tree | a sub graph in which all vertices are connected without cycles and have the lowest total weight of any spanning tree |
| What is Kruskal's Algorithm? | Sort all arcs in ascending weight Arc with least weight is start of tree If the next lowest arc does not form a cycle, add it Stop when all vertices are connected |
¿Quieres crear tus propias Fichas gratiscon GoConqr? Más información.