# Mathematics Links - [[Graph Coloring]] - [[Complete Graphs]] - [[Strongly Connected Components]] # Computer Science Links #### Algorithms - [[Graph Path Algorithms]] - [[Graph Cycle Detection]] #### Storage Methods - [[Array of Edges]] - [[Adjacency List]] - [[Adjacency Matrix]] # General - any collection of nodes & the connections between them - edges can be directed or undirected - nodes connected by edges are called neighbors - **connected components**: group of nodes that are connected by edges (can get from one node to another) - **indegree**: number of edges that can be used to reach the node is a node's indegree - **outdegree**: number of edges that can be used to leave the node - real life examples: - social networks - roads in cities - circuit boards - internet traffic - blockchain # Algorithms - we need to use a set $seen$ to determine previously seen nodes, otherwise if there is a cycle during traversal, you will end in an infinite loop