- Start
- User Group
- Applications
- Functions
- Algorithms
- Interface
- License Model
- Order
- Resources
- Contact
- <
- >

Graph Representation

Every graph in graph solutions can be specified in two different formats: matrix-form and list-form. Arbitrary conversions, manual or automatic, can be applied amongst the formats.

The matrix representation is compact and is well suited for dense graphs with many edges, whereas the list form is better used for large sparse graphs with relatively few edges.

The algorithms in graph solutions can be used with both types of graphs, necessary conversions are applied automatically.

A graph can hold for vertices and edges their names, weights and formats of their graphical representation. Vertices may additionally get locations in two- or threedimensional space. Names of weights are arbitrary and are user-defined, for example NetworkCapacities.

The matrix representation is compact and is well suited for dense graphs with many edges, whereas the list form is better used for large sparse graphs with relatively few edges.

The algorithms in graph solutions can be used with both types of graphs, necessary conversions are applied automatically.

A graph can hold for vertices and edges their names, weights and formats of their graphical representation. Vertices may additionally get locations in two- or threedimensional space. Names of weights are arbitrary and are user-defined, for example NetworkCapacities.

Editorial/Data Protection • page checked on Sep. 27th 2005