17 lines
633 B
Plaintext
17 lines
633 B
Plaintext
= Graph =
|
|
|
|
A Graph is a type of data structure consisting of nodes and linkages between
|
|
these nodes, often represented as pointers. Links between nodes can have the
|
|
option of carrying associated weights or costs to them. They can also either be
|
|
directional, bi-directional, or carry no direction.
|
|
|
|
Any link between two nodes is known as an *edge*, while the nodes are often
|
|
known as *vertexes*. Graphs can be used for a large variety of modeling
|
|
exercises, including Social networks, computer networks, and abstract applications including [[../math/markov_chain|Markov Chians]].
|
|
|
|
== Algorithms ==
|
|
|
|
* [[BFS]]
|
|
* [[DFS]]
|
|
* [[Dijkstra]]
|