Programmer's Wiki


406pages on
this wiki
Add New Page
Talk0 Share

Terminology Edit

  • vertex - points on a graph. aka node
  • edge - connection between two vertices.

Data Structures Edit

Graphs can be represented in several ways. An adjacency list is a list of the graph's vertices. each vertex then has a list of the vertices it is connected to. An adjacency matrix stores edges in a matrix. The rows and columns represent the vertices in the graph. If there is an edge between two vertices, a one is placed at their intersection. the absence of an edge is shown with a zero at that position.

Operations Edit

There are many algorithms that have been created for handling graphs. For searching graphs depth-first search or breadth-first search can be used. Dijkstra's algorithm to find the shortest path from one node to another.

External Links Edit

Ad blocker interference detected!

Wikia is a free-to-use site that makes money from advertising. We have a modified experience for viewers using ad blockers

Wikia is not accessible if you’ve made further modifications. Remove the custom ad blocker rule(s) and the page will load as expected.