# Graph - (Node | Vertice | Vertex | Point)

A node in a graph model an entity

The model graph contains connected the nodes:

• containing any number of attributes (key-value-pairs).
• tagged with labels (to label, attach metadata—​index or constraint information)

## Properties

### Position

A node has also visual property such as (Network|Graph) - Node Position

### Degree

The degree of a node is the number of edge that touch the node.

## Management

### Delete

Since a edge always has a start and end node, you can’t delete a node without also deleting its associated relationships.

### Relationship

The relationship between nodes is known as an edge

Discover More
(Network|Graph) - Force

Force means that the position of the node in a graph are calculated through physical simulations such as the Verlet_integration physical simulations.
Data Processing - Data Flow (ETL | Workflow | Pipeline)

A data flow is a workflow specialized for data processing Any system where the data moves between code units and triggers execution of the code could be called dataflow Dataflow_architecturecomputer...
Graph (Network - Nodes and edges)

A graph is a set of vertices connected by edges. See Data representation that naturally captures complex relationships is a graph (or network). Except of the special graph that a tree is, the data...
Graph - (Edge | Links | Arcs | Lines | Arrows) - Association

An edge model a relationship betweentwo node in a graph. Every edge model therefore a binary relationship (relationship between two elements) . An Edge is also known as: Links Arcs Lines Arrows...
Graph - (Node) Attribute

Node Attributes are descriptive attribute of a node or edge in a graph Egde attribute: weights, costs, distances, ratings, time intervals, or strengths
Graph - Acyclic

Acyclic means that any two vertices (node) are connected by exactlyone path. There is no cycle

adjacent is a graph operator that tests if there is an edge between two vertices; The two vertices have the following binary relation, if the test is: true: is adjacent to false: is not adjacent...
Graph - Cycle

A path that starts from a node and can come back to the same node is called a cycle A graph without a cycle is called acyclic.
Graph - Data Structure (Physical Representation)

A graph is represented generally in a physical data structure The graph is composed of two set. a set of vertices (node) Node a b c and set of egde represented for a : directed graph...
Graph - Degree

In a graph, the degree of a vertex (node) is the number of edges that touch the node (vertex) (ie the number of adjacent edges) degree is also known as valency The original 'six degrees of separation'...