!!! Overview
[{$pagename}] is an [ABSTRACT] [Data type] and [Data Structure] that is meant to implement the undirected graph and directed graph concepts from mathematics, specifically the field of graph theory.


[{$pagename}] [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].



[{$pagename}] [Data Structure] may also associate to each edge some edge value, such as a symbolic label or a numeric [attribute] (cost, capacity, length, etc.).


[{$pagename}] is about visualising [data] in terms of a [{$pagename}] of [objects] and the [Relationships] we ultimately use in our [Applications] like [Objects] or [JSON].

[{$pagename}] may refer to a [Network topology] as a Point-To-Point.

!! More Information
There might be more information for this subject on one of the following:
[{ReferringPagesPlugin before='*' after='\n' }]