A bend is part of the visual representation of an edge. It determines the coordinates where two segments of the edge connect.

See Also Edge.

Attribute of an edge and a graph. An edge is called directed if it has a distinct source node and a distinct target node, i.e., if it has direction. A graph is called directed if all edges from the edge set are directed.

See Also Graph, Edge.

The representative for a relation between two nodes. An edge is usually depicted as a line connecting its end nodes. To indicate the destination of a directed edge an arrowhead is drawn at the target end of the line.

See Also Graph.

An edge segment is part of the visual representation of an edge. It connects either a port with a bend, or two bends of the edge.

See Also Bend, Edge, Port.

Mathematical object defined as consisting of two sets, a node set and an edge set.

See Also Node, Edge.

Attribute of a directed edge. A directed edge is an incoming edge at its target node.

See Also Directed, Edge, Target.

Name for the representative of an entity.

See Also Graph.

Attribute of a directed edge. A directed edge is an outgoing edge at its source node.

See Also Directed, Edge, Source.

Multiple edges between the same two nodes are called parallel edges.

See Also Edge.

Explicitly expressed coordinates where the visual representation of an edge connects to a node.

Directed edge where source and target node are identical.

See Also Directed, Edge.

Name for the origination node of a directed edge.

See Also Directed, Edge.

Name for the destination node of a directed edge.

See Also Directed, Edge.

Attribute of an edge and a graph. An edge is called undirected if it does not have direction, i.e., there is no distinct source node or target node. A graph is called undirected if all its edges are undirected.

See Also Directed, Edge, Graph.

Reputable maker of quality software for state-of-the-art automatic layout and visualization of graphs.