Repository navigation
Graphs
Vertexes are like "nodes" in a graph. Vertexes don't have a "next", instead they have edges that connect them to their neighbor vertexes.
These are the lines connecting each vertex to one or more other vertexes.
Graphs with "bi-directional" edges. An undirected graph has bi-directional edges, meaning there are no "arrows" in the lines you draw between nodes/vertexes.
Directed graphs contain vertexes that can only go one direction. Once we go one direction, we can no longer go back. Trees are a type of directed graph.
A tree is a directed-acyclic graph. As you go down edges, you can never go back
Every single vertex connects to everything else
Where every single vertex has one or more edges
A graph where some vertexes don't have edges to a neighbor. "Islands" are vertexes that aren't connected.
Resouces: Graphs
All wiki pages are summaries of the work of others. See the top of each page for the source blogs/articles/books and their authors. All other content by Billy Bunn.