A 2-connected (biconnected) graph is a connected graph that will remain a connected graph if a discretionary node is removed. (In other words, a graph in which at least two distinct paths exist between every two nodes.)

An immediate command triggered by a specific keyboard event. The event is recognized by the container or manager that calls a predefined function.

A graph that has no cycles.

The lining up of objects on one of their edges.

Application Programming Interface. Software that enables external applications to access and implement code that provides otherwise inaccessible functions.

American Standard Code for Information Interchange. A standard coding method for computer representation of alphanumeric and other characters.

A globally defined SQL session that can be shared by multiple SQL data source objects.

A feature establishing the relationship between 1) the size of an object and the size of the window in which it is contained, 2) a side of an object and the corresponding side of the window. The feature allows you to define whether objects change when the window in which they are contained changes, and, if so, how. See also elastic, fixed.

A layout process where the layout algorithm does everything without any user intervention.

In C++, the class from which another class is derived.

See 2-connected graph.

A graphic image made up of an array of bits or pixels in memory. See pixel.

Bitmap graphic format.

Special markers used in SQL statements in place of literal values.

The smallest possible rectangle surrounding one or more objects.

A part of the memory in a computer used for holding temporary data.

A type of network topology where a set of nodes is connected to a bus object.

In a computer graphic interface, an object that, when clicked, initiates a predefined action.

An object-oriented computer programming language based on the C programming language.

Compressed ARC Digitized Raster Graphics. A map format for scanned maps published by the U.S. National Imagery and Mapping Agency (NIMA)

A function invoked by the operating system when a specific event, such as a mouse click, occurs.

A program model of a group of objects with similar characteristics.

A GUI gadget used to display items in a pop-up menu for selection. See gadget.

In Views, the list of user commands applied to objects that can be used to undo or redo previous commands.

An SQL command that successfully terminates a transaction by permanently updating the database. See also ROLLBACK.

A connected component of graph G is a maximal connected subgraph of G.

A graph where there is a path connecting each pair of nodes.

Another name for an edge of a graph. See also edge.

In C++, a special member function called to initialize an object

An object in Views that contains a set of gadgets. A container is also referred to as a panel.

An edge is a cut-edge if the graph is no longer connected when the edge is removed from the graph. In the following illustration, the link between nodes 3 and 5 is a cut-edge. Note that its end points are cut-nodes.

A node is a cut-node if the graph is no longer connected when the node is removed from the graph. In the following illustration, node 5 is a cut-node.

A path of a graph that begins and ends on the same node. Also called a loop.

A graph that contains cycles.

A number equal to m - n + 1, where m = number of edges and n = number of nodes. In the following illustration, the number of edges = 10, the number of nodes = 8. Therefore, the cyclomatic number is 10 - 8 + 1 = 3

A computerized collection of data stored in such a way that it can be retrieved and displayed by application software. See also relational database.

Software that manages the interaction between users and the database.

The form (columns and rows) in which data is organized in a relational database (see also relational database).

A region of a computer memory used for storing data that usually resides elsewhere to make it more easily accessible.

In Data Access, an object that manages the flow of data between a remote database or other source of data and an application. The data source can be connected to a database for retrieval and insertion of data and to gadgets for the display of data. It uses a data cache to store the data in tables for these purposes. See also data cache.

A special gadget that can be linked to a data source and used to display and edit data originating from a database.

A data-source-aware gadget that can dynamically change its look.

See database management system.

The degree of a node is the number of neighbors of the node.

In C++, a special member function called when an object is destroyed.

In a graphical user interface, an item that is grayed out and cannot be selected.

A graph in which every edge is associated with an ordered pair of nodes. Also called an oriented graph.

A graph is disconnected if at least two nodes are not linked by a path. In the following illustration, node 5 is not linked by a path to any other node. Nodes 3 and 4 are not linked by a path to any nodes other than nodes 3 and 4.

A technique for displaying animated graphics on a screen without flicker.

In a graphical user interface, an operation whereby an object is moved by dragging it with the mouse and leaving it in another location.

Digital Terrain Elevation Data. A map format for terrain elevations published by the U.S. National Imagery and Mapping Agency (NIMA).

Digital Terrain Model.

A file created for printing out data.

See link crossing.

An edge connects two vertices in a graph. An edge is also called a link or a connection. In this documentation, the term link is primarily used for the term edge.

In Data Access, the area of the Main window containing buttons for changing the editing mode to selecting, text editing, menu editing, line creating, and so on.

An attribute of an attachment given to an object to allow it to proportionally change its size or its distance from the edge of the window in which it is contained as the window is resized. See attachments, fixed.

A window used to select a file for operations such as opening, saving, importing, and so on. Also called File Chooser.

A design used to fill up an enclosed space in a graphic image.

An attribute of an attachment given to an object to make unchangeable the distance of one side of an object from the corresponding side of the window in which it is contained when the window is resized. Also, to make unchangeable the size of the object when the window is resized.

If the user specifies a node as fixed, layout algorithms are not allowed to move this node.

If the user specifies a link as fixed, layout algorithms are not allowed to reshape this link.

The order in which objects in a window are selected (that is, own the keyboard focus) as the Tab key is repeatedly pressed.

A class of layout algorithms for creating straight-line drawings of undirected graphs based on an iterative computation of the position of the nodes according to a set of attractive and repulsive “forces”. These forces are computed in such a way that they tend to produce a layout with only a few link crossings or no link crossings.

A table object that is used to specify a mapping for a particular column in another table object.

In Data Access, a group of gadgets and other elements used to display or edit one row of a data source table at a time. See also data source.

A graphic object used as an interactive item in a graphical user interface; for example, buttons, scroll bars, sliders, and text fields.

In Views Studio, a window containing graphical user interface gadgets that can be dragged to the work space for editing.

A type of chart for comparing rates, often used in production planning as a timeline bar chart.

In Views Studio, the C++ code that corresponds to the interface panel being created and which can be generated at will.

The area of the main window that displays the attributes of an object selected in the work space.

A map feature geometry is information relating to its shape (line, polygon, raster, and so on) and position.

A data source that can be accessed from panels other than the one it is contained in, is said to have global scope.

A graph consists of a finite set of nodes (also called vertices) connected by a finite set of links (also called edges or connections).

In Views, an instance of the class IlvGrapher. More generally, an object that is used to manage a collection of nodes and links.

The process that applies a layout algorithm to a graph. The graph drawing that results from a layout process.

In the Views Graph Layout package, a class that defines a suitable, generic API for graphs or an instance of the class (IlvGraphModel).

A defined pictorial entity having functionality that allows it to be drawn, saved, and resized. There are many predefined graphic objects such as rectangles and ellipses as well as more complex objects such as shaded labels, zoomable icons and gadgets.

A basic drawing function for creating geometric forms such as a point, line, arc, and so on.

The window and graphic objects displayed on the screen with which the user interacts to operate a computer program.

In Views Studio and ilvdraw, a window containing predefined graphic objects that can be dragged into the Views Studio Main window for editing.

A drawing where nodes and link bends have discrete (integer) coordinates.

See graphical user interface.

In Data Access, a line used as a reference for attaching objects to a window. See also attachments.

In Views, an object used to reference another object. Using handle objects, the same object can be displayed more than once without duplicating it.

In C++, a file containing the interface to a class or set of related functions and data declarations. Same as include file.

In Views, a mechanism whereby an event is detected in a view causing a virtual member function to be called.

A graphic image used in a GUI to represent a particular object or function.

In Views, the editor for building a GUI.

A link is incident to a node if the node is at one end of the link. A node is incident to a link if that link is incident to the node.

Same as header file.

A layout process where the result of a previous layout is used as the starting inspector panel.

A behavior that can be attached to an object to make it function in a certain way. For example, a button interactor attached to an object makes that object act like a button. See behavior.

An operation whereby two tables are combined to give a new table.

See primary key.

In Views, the storage area of a manager in which graphic objects are placed. A manager uses multiple layers, indexed by index numbers. Objects in a higher-numbered layer are displayed in front of objects in a lower-numbered layer.

The process that computes new coordinates for nodes and/or new shapes for links in order to obtain a suitable representation of a graph.

In the Views Graph Layout package, the rectangle where the graph drawing will be placed when the graph is laid out.

In Views, layout listeners allow you to connect events that occur in the graph layout algorithms to actions to be performed.

In data processing, a collection of reusable software components.

Another name for an edge in a graph. In this documentation, the term link is primarily used for edge. See also edge.

Link crossings occur when links intersect at places other than an incident node. Also called edge crossings. Often, layout algorithms are used to minimize the number of link crossings.

See layout listener.

Load-on-demand is a mechanism that lets you load into memory only the portion of a map that you want to view. This capability is implemented via a specific manager layer, called a tiled layer.

A collection of data and/or methods that allow internationalized C library and system-dependent library functions to comply with the users’ language, local customs, and data encoding. The locale determines the characters and fonts used to display the language. It also determines how programs display and sort dates, times, currency, and numbers.

See cycle.

A function which provides the entry point for an application.

In programming, a special file used to compile a program. Views Studio automatically generates a makefile to compile the panel being created.

In Views, a holding place for grouping graphic objects and coordinating their behavior and display in multiple layers and views.

A map feature is an object that represents a cartographic data as it was read from its source file. It can be a segment of road, an aerial image, the summit of a hill, or a digital terrain model. A map feature holds three main information fields: its geometry, the projection in which its geometry is expressed, and its attributes.

The map loader is a facility supplied with Views Maps that allows you to import into an Views manager a map that has a predefined format. Predefined formats in Views are CADRG, DTED, Shapefile, and OGDI.

Matching tables so that cells in one table refer to specific cells in another table.

In C++, an operation defined as part of a class.

In Data Access, an entity used for holding table data in memory for temporary purposes without needing to be stored in a database. SQL cannot be used, but mapping to regular data sources is possible.

A table object in Data Access that is managed locally. It is a one-tier table.

In Data Access, an area of the Main window for displaying system messages and the class of an object selected in the work space.

In Data Access, an editor used to create the text for multilingual messages and labels.

In Data Access, a gadget used for displaying messages.

See member function.

A graphical user interface built on the X Window System in the UNIX environment.

Microsoft Windows. The graphical user interface built on MS-DOS in the PC environment.

In Data Access, a GUI gadget used to create a text field of more than one line. See gadget.

Multiple links occur when there is more than one link between the same origin and destination nodes.

The nodes that are connected to a given node by a link.

National Imagery and Mapping Agency.

Another name for a vertex of a graph. In this documentation, the term node is primarily used for vertex.

A nonplanar graph is a graph that cannot be drawn without any links crossing other links.

A class of computational problems for which no efficient solution algorithm has been found. Many significant computer-science problems, including many graph layout problems, belong to this class.

A behavior that can be applied to an object.

A type of computer programming that focuses on the data to be manipulated (objects) rather than on the methods (procedures) that do the manipulating.

A table where rows are managed in the process memory space. Only the local process is implemented to manage the table.

In Data Access, a GUI gadget used to create a pop-up menu.

A drawing where each link is drawn as a polygonal chain of alternating horizontal and vertical segments.

In Views, a specific collection of resources (fill patterns, line patterns, colors, font attributes), which can be shared by any number of objects. See resource.

In Data Access, a window containing graphical user interface gadgets that can be dragged to the Data Access work space for editing.

A window that contains mainly gadgets.

The hierarchy of directories from the root directory to the directory in which the current file is found.

The smallest element in a raster graphic image. Pixels are arranged in a two-dimensional array to make up the image.

A planar graph is a graph that can be drawn with no links crossing other links.

A drawing where each link is drawn as a polygonal chain.

A menu that appears when an item is clicked in a GUI.

A page-description language for printing.

Portable Operating System Interface.

In a relational database, the unique identifier for a table. It consists of one or more columns having the property such that each value of the row in those column(s) must be unique.

See graphic primitive.

A map projection consists of projecting the surface of the Earth, or a portion of it, onto a flat surface such as a piece of paper or a computer screen. Since the Earth has an ellipsoidal shape, attempts to project its points on a plane always results in some kind of distortion of conformality, distance, direction, scale, and area. Map projections fall into three main categories: cylindrical, conic, or azimuthal. A projection can also be conformal, meaning that it preserves angles, or equal area, meaning that it displays true area ratio. A map has always an associated projection.

A window that appears on the screen asking the user to provide information so that the program can continue.

A type of data structure for efficient management of large quantities of data.

A layout style where the nodes are placed radially around a root node.

A technique for more efficiently redisplaying graphics on the screen.

A database in which the user perceives the data as structured in tables (that is, in columns and rows), as opposed to, for example, a database structured as a hierarchical tree.

A renderer is an object that transforms a map feature into an Views graphic object that can be displayed via a manager.

In Views, an attribute that can be applied to graphic objects. It includes color, line style, fill pattern, and font. It is a string that can be used to customize an aplication at run time. See also fill pattern.

A file that stores a set of data blocks that can be retrieved at run time using the name with which they were associated when building the file.

An SQL command that cancels a transaction. See also COMMIT.

The first level in the hierarchy of directories containing files.

S-57 is the electronic data transfer standard prepared by the International Hydrographic Organization (IHO) committee. The geodatabase model allows the user to import Electronic Navigational Charts (ENC) .000 files, which in turn provides the user with a highly accurate vector data set that is ideal as foundation data.

A scale filter is a filtering functionality that you can use to show or hide a manager’s layer, and hence its contents, when its scale factor is between specified values.

The organizational structure of the database.

Horizontal and vertical sliders that permit the user to move the contents of a window to show data that cannot be displayed in one frame.

A GUI gadget used to display items in a pop-up menu with a scroll bar for selection. See gadget, scroll bar.

A GUI gadget used to display a list of items with scroll bars. See gadget, scroll bar.

The value that is used for the initialization of a random numbers generator. Some layout algorithms use random numbers during the layout computation.

In Views Studio, the editing mode for selecting, moving, and resizing objects.

A composite gadget made of more than one toggle button functioning so that when one button is selected others are not.

A link whose origin and destination nodes are the same node.

A layout process where the user makes manual improvements to the result of the automatic layout process.

An exchange format for vector maps of the Environmental Systems Research Institute (ESRI). This format supports polygons, arcs, lines, and points.

An interface operating on top of a computer operating system to allow the user to more easily manipulate programs and data.

A GUI gadget used to activate a continuous action by dragging a button with the mouse.

The file containing the original code for implementing an application.

A spanning tree S of a graph G is a subgraph of G containing all the nodes of the graph and whose links are a subset of the links of the graph. The number of links of G that are not present in S must be the minimum number for which there are no cycles in S. The spanning tree is shown by the red links in the following illustration.

See structured query language.

In Data Access, an object that encompasses a dialog between an application and the DBMS, that is, a connection between the application and the database.

A layout process where the layout algorithm is completely redone each time the graph is changed.

A drawing where each link is drawn as a straight line segment.

In Data Access, a GUI gadget used to display a list of items.

A computer language used with relational databases. See also relational database.

In C++, a class situated below its parent class in the class hierarchy. It inherits features from the parent class.

G' is a subgraph of G if its node and link sets are included in the node and link sets of G.

A menu that appears when an item is selected in a higher-level menu.

Such as requests for access, retrieving and inserting data, creating database tables, and so on.

The form (columns and rows) in which data is organized in a relational database. See also relational database.

A special buffer that stores a row of a table in Data Access.

A database-specific gadget used for displaying data in table form. It can be updated through connection to a data source. See also data source, gadget.

An object that is used to monitor the current state of a table object.

An instance of the IliTable class in Data Access. This object is an abstract representation of a table that is used to handle data. Data-source-aware gadgets can be linked to a column of a table object to display the column values.

A GUI gadget used to display text in one line for display and editing.

Tagged Image File Format.

A tile is a rectangular area that constitutes the basic element of a tiled layer. A tile can be loaded into memory and be visible in a view or can be placed in a cache. Cached tiles are still loaded into memory but are no longer visible. Cached tiles are eligible for unloading.

A tiled layer is a particular type of manager layer specifically designed to support load-on-demand. A tiled layer is divided into a set of rectangular tiles of identical size that form a tiling grid.

In Views Studio, a GUI gadget used as an off/on switch. Also called toggle switch.

A data-source-aware composite gadget made up of more than one toggle gadget that functions so that when one button is selected the others cannot be selected.

A set of buttons used to trigger commands when creating and manipulating windows and applications.

In Views, an operation that changes a graphic representation by moving, scaling (zooming), or rotating.

A tree is a connected acyclic graph (that is, a graph that does not contain any cycles).

The structure of a graph. Two drawn graphs have the same topology if you can obtain one drawing from the other by moving the nodes and reshaping the links.

A table that is managed on a remote database. A two-tier table interacts with another process.

A graph in which every link is associated with an unordered pair of nodes.

A graphic image made up of geometric graphic elements such as points, arcs, and lines.

A vertex is a “dot” in a graph. A graph consists of a finite set of vertices connected by a finite set of edges (also called links or connections). A vertex is also called a node. In this documentation, the term node is primarily used for the term vertex.

A computer user interface with advanced functionality. See graphical user interface.

See very graphical user interface.

In Views, a view is the component where graphic objects are displayed. To display graphic objects contained in the different layers of a grapher, you create at least one view, and often multiple views. The grapher lets you connect as many views as you require to display graphic objects.

A behavior that can be applied to a view as a whole and which thus affects all the objects in the view. See view.

(Probably from "window gadget:): a reusable component of the graphical user interface which combines a predefined graphic with the program code that determines its behavior. Base of the Motif Toolkit.

The area of the Main window where the GUI is constructed.

A windowing system used in the UNIX environment.