Showing 0–0 of 0 results
| # | Exercise Title | Features | Description | Platform | Keywords |
|---|---|---|---|---|---|
| 1 | Graph Concept Practice Questions | Question, Battery, Concept Map | Self-assessment question battery about graphs, using a concept map. | OpenDSA | Graph |
| 2 | Graph Introductory Practice Questions | Question, Battery | Self-practice questions related to graph terminology and representation. | OpenDSA | Graph Representation |
| 3 | Space Requirements for Graph Representations Exercise | Calculation Exercise | User must calculate the space requirements for a specified graph representation scenario. | OpenDSA | Graph Representation |
| 4 | Breadth-First Search Graph Traversal Visualization | Algorithm Visualization | Visualization for breadth-first search to traverse a graph. | OpenDSA | Breadth-First Search |
| 5 | Breadth-First Search Graph Traversal Proficiency Exercise | Tracing Exercise | Proficiency exercise for breadth-first search to traverse a graph. User must indicate the order in which nodes are visited by... | OpenDSA | Breadth-First Search |
| 6 | Depth-First Search Graph Traversal Proficiency Exercise | Tracing Exercise | Proficiency exercise for depth-first search to traverse a graph. User just indicate the order in which nodes are visited by... | OpenDSA | Depth-First Search |
| 7 | Misunderstanding Examples: Graph Visualization | Presentation | Slideshow illustrating various growth rate behaviors. | OpenDSA | Problem, Algorithm, Program |
| 8 | Breadth-first graph traversal slideshow | Algorithm Visualization | Slideshow demonstrating the breadth-first search algorithm for traversing a graph. | OpenDSA | Breadth-First Search |
| 9 | Depth-first graph traversal slideshow | Algorithm Visualization | Slideshow demonstrating the depth-first search algorithm for traversing a graph. | OpenDSA | Depth-First Search |
| 10 | Hamiltonian Cycle Proficency Exercise | Proficiency Exercise | User must determine whether a given graph has a Hamiltonian cycle. | OpenDSA | Hamiltonian Cycle Problem |
| 11 | Clique Proficency Exercise | Proficiency Exercise | User must determine the largest clique in a given graph. | OpenDSA | Clique Problem |
| 12 | Independent Set Proficency Exercise | Proficiency Exercise | User must determine the largest independent set in a given graph. | OpenDSA | Independent Set Problem |
| 13 | Traveling Saleseman Proficency Exercise | Proficiency Exercise | User must determine the shortest complete cycle in a given graph. | OpenDSA | Traveling Salesman Problem |
| 14 | Vertex Cover Proficency Exercise | Proficiency Exercise | User must determine the smallest vertex cover in a given graph. | OpenDSA | Vertex Cover Problem |
| 15 | Kruskal's Minimal-Cost Spanning Tree Algorithm slideshow | Algorithm Visualization | Slideshow demonstrating Kruskal's algorithm for constructing the minimal cost spanning tree for a graph. | OpenDSA | Minimal-Cost Spanning Tree |
| 16 | Prim's Minimal-Cost Spanning Tree Algorithm slideshow | Algorithm Visualization | Slideshow demonstrating Prim's algorithm for constructing the minimal cost spanning tree for a graph. | OpenDSA | Minimal-Cost Spanning Tree |