Graphics Reference
In-Depth Information
Path
A series of links traversed to reach one node from another.
Planar Graph
A graph that can be drawn without links crossing.
Neighborhood
The subgraph around a node consisting of its linked nodes and any links
between them. In social networks, an ego network is a neighborhood.
Neighborhoods may be defined by degrees.
Node
Anentity(or“thing”)linkedtootherentities(orthings).Ingraphtheory,
a node is typically referred to as a vertex.
Sankey Diagram
A visualization technique where nodes are arranged in columns, and
links of varying size flow in one side and out the other.
Self-Loop
A link in which both the start and end are connected to the same node.
Shortest Path
The minimal path or distance between two nodes.
Spanning Tree
A subgraph that includes all connected nodes but only the minimal set of
links needed to connect them, thus forming a tree.
Spatial Network
A graph in which node locations reflect intrinsic spatial attributes of the
elements represented, rather than relationships to other nodes.
Subgraph
A subset of nodes and links in a graph.
Tree
A graph that contains no circular paths and has only one path between
any two nodes. A hierarchy is an example of a tree.
Undirected Graph
A graph in which link direction is not meaningful (such as links that
represent mutual relationships like friendships).
Vertex
Anentity(or“thing”)linkedtootherentities(orthings).Avertexismore
commonly known as a node.
Search WWH ::




Custom Search