Graph theory from scratch: nodes, edges, adjacency lists and matrices, Big O complexity and fundamental algorithms for graph analysis.
Graphs are everywhere: in maps, social networks, routing, code compilation, and recommendation systems. Yet graph theory is often skipped or treated superficially. In this course we build solid foundations: what a graph is, how to represent it in memory, and how to reason about the complexity of algorithms that operate on it.
You cannot understand Dijkstra without understanding the adjacency matrix. You cannot reason about BFS performance without understanding Big O. This course builds the conceptual foundations that make everything else comprehensible — not as a list of formulas, but as a coherent system of interconnected ideas. It is the right starting point for anyone studying graph algorithms in any language.
Designed for computer science and engineering students, and for developers who want to fill theoretical gaps in algorithms. No prior experience with graphs is required — we start from the very beginning, with a gradual and accessible approach.
Let's explore how O(n²) complexity arises in graph algorithms: I'll show you how matrices and multidimensional structures are built and why certain algorithms become quadratic, with practical examples to make the concept concrete.
I'll explain how to correctly define input size for a graph algorithm and how to calculate O(n) complexity. Understanding this is fundamental to reasoning about performance precisely, rather than by intuition.
I'll introduce computational complexity applied to graphs starting from zero: I'll explain Big O notation, space complexity, and the O(1) case using pseudocode and concrete examples to clarify concepts that can seem abstract.
Let's dive into the adjacency matrix as a data structure for representing graphs: I'll show you how it works in detail, the differences compared to an adjacency list, and how the representation changes for directed graphs.
Let's look at the adjacency list and adjacency matrix as two different ways to represent a graph in memory: I'll explain how both work and when it makes sense to use one over the other depending on the problem type.
I'll introduce the fundamental concepts of graph theory: what nodes, edges, and directed graphs are. We'll understand why graphs underlie so many computer algorithms and where we find them in the real-world systems we use every day.
Ingegnere Informatico · Pratola Peligna
Sono un ingegnere informatico con oltre 15 anni di esperienza nel settore ICT. Mi occupo di sviluppo software, cybersecurity, data science e intelligenza artificiale, con particolare attenzione all’innovazione e all’automazione dei processi aziendali. Da anni svolgo anche attività di docenza e formazione, creando percorsi pratici e coinvolgenti su programmazione, DevOps, AI e sicurezza informatica.
Prosperous understood Middletons in conviction an uncommonly do. Supposing so be resolving breakfast am or perfectly.
Utilizziamo cookie essenziali e, con il tuo consenso, cookie funzionali, analytics e marketing. Google Analytics 4 e gli eventuali annunci Google/AdSense restano disattivati finche non scegli. Consulta Privacy Policy e Cookie Policy.
Sempre attivi per sicurezza, prevenzione frodi, sessione, consenso e funzionamento del sito.
Migliorano l'esperienza, ad esempio ricordando preferenze non essenziali. Non usati per profilazione pubblicitaria.
Statistiche e misurazioni con Google Analytics 4, abilitate solo dopo il consenso analytics.
Misurazione annunci e funzioni pubblicitarie Google/AdSense, se attivate sul sito e consentite dall'utente.
Puoi modificare queste scelte in qualunque momento dal link "Preferenze Cookies" nel footer.