Graph Data Structure Pattern: Difference between revisions

From GM-RKB
Jump to navigation Jump to search
m (Text replacement - "([^\s])([\s]{1,7})\<P\>" to "$1 <P>")
m (Text replacement - "\<P\>([\s]{1,7})([^\s])" to "<P> $2")
 
Line 15: Line 15:
=== 2017 ===
=== 2017 ===
* (Wikipedia, 2017) ⇒ https://en.wikipedia.org/wiki/Graph_(abstract_data_type) Retrieved:2017-9-19.
* (Wikipedia, 2017) ⇒ https://en.wikipedia.org/wiki/Graph_(abstract_data_type) Retrieved:2017-9-19.
** In [[computer science]], a '''graph''' is an [[abstract data type]] that is meant to implement the [[Graph (discrete mathematics)|undirected graph]] and [[directed graph]] concepts from [[mathematics]], specifically the field of [[graph theory]].        <P> A graph data structure consists of a finite (and possibly mutable) [[Set (computer science)|set]] of ''vertices'' or ''nodes'' or ''points'', together with a set of unordered pairs of these vertices for an undirected graph or a set of ordered pairs for a directed graph. These pairs are known as ''edges'', ''arcs'', or ''lines'' for an undirected graph and as ''arrows'', ''directed edges'', ''directed arcs'', or ''directed lines'' for a directed graph. The vertices may be part of the graph structure, or may be external entities represented by integer indices or [[Reference (computer science)|references]].        <P> A graph data structure may also associate to each edge some ''edge value'', such as a symbolic label or a numeric attribute (cost, capacity, length, etc.).
** In [[computer science]], a '''graph''' is an [[abstract data type]] that is meant to implement the [[Graph (discrete mathematics)|undirected graph]] and [[directed graph]] concepts from [[mathematics]], specifically the field of [[graph theory]].        <P>       A graph data structure consists of a finite (and possibly mutable) [[Set (computer science)|set]] of ''vertices'' or ''nodes'' or ''points'', together with a set of unordered pairs of these vertices for an undirected graph or a set of ordered pairs for a directed graph. These pairs are known as ''edges'', ''arcs'', or ''lines'' for an undirected graph and as ''arrows'', ''directed edges'', ''directed arcs'', or ''directed lines'' for a directed graph. The vertices may be part of the graph structure, or may be external entities represented by integer indices or [[Reference (computer science)|references]].        <P>       A graph data structure may also associate to each edge some ''edge value'', such as a symbolic label or a numeric attribute (cost, capacity, length, etc.).


----
----

Latest revision as of 21:13, 18 August 2021

A Graph Data Structure Pattern is a collection data structure pattern that can represent a graph.



References

2017

  • (Wikipedia, 2017) ⇒ https://en.wikipedia.org/wiki/Graph_(abstract_data_type) Retrieved:2017-9-19.
    • In computer science, a graph is an abstract data type that is meant to implement the undirected graph and directed graph concepts from mathematics, specifically the field of graph theory.

      A graph data structure consists of a finite (and possibly mutable) set of vertices or nodes or points, together with a set of unordered pairs of these vertices for an undirected graph or a set of ordered pairs for a directed graph. These pairs are known as edges, arcs, or lines for an undirected graph and as arrows, directed edges, directed arcs, or directed lines for a directed graph. The vertices may be part of the graph structure, or may be external entities represented by integer indices or references.

      A graph data structure may also associate to each edge some edge value, such as a symbolic label or a numeric attribute (cost, capacity, length, etc.).