Skip to content

Latest commit

 

History

History
46 lines (34 loc) · 1.61 KB

graph_theory.md

File metadata and controls

46 lines (34 loc) · 1.61 KB

Graph Theory

History


In 1736 Leonhard Euler solved a navigation question by creating what eventually becomes graph theory.

Directed Graphs


A directed graph consists of nodes and edges that connect nodes with specified directionality. Directionality determines a pathway to reaching nodes.

Commits as Nodes


Commits are nodes in a directed graph and typically have: - metadata including author, SHA id, message & date created - snapshot state of the files the repository manages - directed edge towards a parent node

Logs as Graphs


Git leverages references in the form of branches and tags. References make commits reachable.

Referable Pathways


Commit nodes have edges that point to a parent commit. This, along with branches and tags, form referable pathways through specific snapshots of the repository.

Resources