Graphs
Computer Science · University of Applied Sciences · Data Structures and Algorithms
This unit introduces the fundamental concepts of graph theory, including graph representation, traversal algorithms (BFS, DFS), and their applications in various domains. Students will gain a solid understanding of graph structures and their use in solving real-world problems.
Zum Üben gibt es 50 Aufgaben. Jede Antwort bekommt sofort eine Rückmeldung, kostenlos und ohne Anmeldung.
Das gehört dazu
- Graph Representation (Adjacency List
- Adjacency Matrix)
- Breadth-First Search (BFS)
- Depth-First Search (DFS)
- Shortest Path Algorithms (Dijkstra's
- Floyd-Warshall)
- Minimum Spanning Tree Algorithms (Kruskal's
- Prim's)
- Graph Connectivity
- Strongly Connected Components
- Graph Applications (Social Networks
- Routing
Stichworte
- Graph Representation
- BFS
- DFS
- Graph Applications
- Shortest Path
- Minimum Spanning Tree
- Topological Sort