Graph Algorithms: Difference between revisions
From Rice Wiki
(Created page with "A '''graph''' is a set of vertices and a set of edges connecting those vertices. Graph algorithms solve problems relating to graphs. Notable examples include traversal and shortest path.") |
No edit summary |
||
| Line 1: | Line 1: | ||
A '''graph''' is a set of vertices and a set of edges connecting those vertices. Graph algorithms solve problems relating to graphs. Notable examples include traversal and shortest path. | A '''graph''' is a set of vertices and a set of edges connecting those vertices. Graph algorithms solve problems relating to graphs. Notable examples include traversal and shortest path. | ||
[[Category:Computer Science]] | |||
Revision as of 19:33, 17 May 2024
A graph is a set of vertices and a set of edges connecting those vertices. Graph algorithms solve problems relating to graphs. Notable examples include traversal and shortest path.
