These excerpts showcase workshops focused on graph data structures and analysis within computational design contexts. The content covers foundational programming concepts like classes, nodes, and edges, explaining how to represent graph data, including handling positional information (XYZ) and creating weighted edges. Various graph algorithms, such as Breadth-First Search (BFS), Dijkstra's algorithm, and A search*, are discussed for tasks like finding the shortest path. The sources also demonstrate practical applications, such as cycle detection and topological sorting, and explore the use of external libraries like NetworkX and custom Grasshopper plugins for network analysis and visualization, emphasizing the importance of data cleaning and the strategic use of randomization with seeds.

https://namjulee.github.io/njs-lab-public/work?id=2025-introductionToDesignComputation