SI 301 Lecture Notes - Lecture 1: Social Network, Giant Component
Document Summary
Have connections between other pieces of information. Relationships where one has the same relationship to the other (unidirectional connection) Moving from node to node through edges, how far are things from each other (how many connections are in between two nodes) Paths - sequence of nodes connected by an edge. Cycle - path of at least three nodes, where the first and last node is the same and the other nodes are distinct (no repeats) Connected - if for every node, you can reach every other node. There cannot be other nodes that have paths to the nodes in teh subset. Connected component - a subset of nodes so that it is connected. Giant component - a component that contains a large portion of the nodes of the graph. Usually if there is a giant component there is only one. Distance - path length (how many edges in between) Average distance between every pair of nodes.
