Graphs: Difference between revisions
| Line 4: | Line 4: | ||
=Overview= | =Overview= | ||
Graphs are fundamental structures in | Graphs are fundamental structures in computer science. They apply directly to a large number of problems that involve physical networks - such as the phone network or the internet, or logical networks about parallel relationships between objects in general - the order in which to execute interdependent tasks, or the analysis of social networks, for example. | ||
Graphs are backed by mathematical formalism. The [[Graph Concepts]] page provides a number of terms and some mathematical tools that are useful when dealing with graphs. [[Graph Representation in Memory]] describes ways to represent graph nodes and edges in such a way that they can be manipulated by algorithms. The most common arrangements - adjacency lists and adjacency matrices - are discussed. | Graphs are backed by mathematical formalism. The [[Graph Concepts]] page provides a number of terms and some mathematical tools that are useful when dealing with graphs. [[Graph Representation in Memory]] describes ways to represent graph nodes and edges in such a way that they can be manipulated by algorithms. The most common arrangements - adjacency lists and adjacency matrices - are discussed. | ||
Revision as of 19:02, 1 October 2021
Internal
Overview
Graphs are fundamental structures in computer science. They apply directly to a large number of problems that involve physical networks - such as the phone network or the internet, or logical networks about parallel relationships between objects in general - the order in which to execute interdependent tasks, or the analysis of social networks, for example.
Graphs are backed by mathematical formalism. The Graph Concepts page provides a number of terms and some mathematical tools that are useful when dealing with graphs. Graph Representation in Memory describes ways to represent graph nodes and edges in such a way that they can be manipulated by algorithms. The most common arrangements - adjacency lists and adjacency matrices - are discussed.