Graph data structures and algorithms

• Titel: Graph data structures and algorithms
• Titelzusatz: implement graphs in Python
• Mitwirkende: Karimov, Elshad [MitwirkendeR]
• Institutionen: O'Reilly (Firm), [Verlag]
• Ausgabe: [First edition].
• Verlagsort: [Sebastopol, California]
• Verlag: O'Reilly Media, Inc.
• Jahr: 2024
• Umfang: 1 online resource (1 video file (2 hr., 48 min.))
• Illustrationen: sound, color.
• Fussnoten: Online resource; title from title details screen (O’Reilly, viewed June 12, 2024)
• Datenträger: Online-Ressource
• Sprache: eng
• Sach-SW: Python (Langage de programmation)
• Sach-SW: Structures de données (Informatique)
• Sach-SW: Instructional films
• Sach-SW: Nonfiction films
• Sach-SW: Internet videos
• Sach-SW: Films de formation
• Sach-SW: Films autres que de fiction
• Sach-SW: Vidéos sur Internet
• K10plus-PPN: 1892757478
• K10plus-PPN:
  Universitätsbibliothek
• Lokale URL UB: Zum Volltext
• Lokale URL UB: Bibliothek der Medizinischen Fakultät Mannheim der Universität Heidelberg
• Bibliothek/Idn: UW / m4544419107
• Lokale URL Inst.: Zum Volltext

Abstract

Dive into the intricate world of graphs with our comprehensive course designed to equip you with the foundational and advanced skills of graph theory, graph data structures, and algorithms. This topic holds paramount importance as graphs are everywhere in today's data-driven era, from social networks and the internet to biological networks and beyond. Understanding graph theory and algorithms is not only a pathway to decipher the complex, interconnected data world but also a vital skill to enhance efficiency and innovation in various professional realms. In the first module, unravel the basics of graph theory and structures, steering from understanding ‘What is a Graph’ to practical implementations like creating, adding, and removing vertices and edges using Python. The second module is tailored to unfold the intricacies of Graph Traversal, emphasizing Breadth and Depth First Searches, and contrasting their utilities and applications. The third module catapults you into the realm of advanced graph algorithms including Topological Sort and shortest path algorithms like Dijkstra's, Bellman Ford, and Floyd Warshall.