-
1 graph
• diagrammi• kaavio• kaavakuva• graafinen esitys• graafi• graafinen estys• käyrä• käyrädiagrammiautomatic data processing• kuvio (atk)• kuvio• piirros* * *(a diagram consisting of a line or lines drawn to show changes in some quantity: a graph of temperature changes.) graafinen esitys, diagrammi- graphic- graphically
- graph paper -
2 flow graph
• virtauskaavioautomatic data processing• kulkukaavio -
3 overlay graph
automatic data processing• peitekuvio -
4 plot
• palsta (maa-)• palsta (maa)• palstaautomatic data processing• tulostaa piirturilla• tonttiautomatic data processing• tulostaa(piirturilla)• intrigoida• juonitella• juonia• juoni• juonittelu• vehkeillä• viljelys• viljelmä• diagrammi• esittää graafisesti• punoa• punoa salajuonia• punoa juonia• kieroilla• kiinteistö• merkitä• sarka• salahanke• salaliitto• salajuoni• maatilkku• suunnitella• piirtää• piirturituloste* * *plot 1. noun1) (a plan, especially for doing something evil; a conspiracy: a plot to assassinate the President.) salajuoni2) (the story of a play, novel etc: The play has a very complicated plot.) juoni3) (a small piece of land eg for use as a gardening area or for building a house on.) maapalsta2. verb1) (to plan to bring about (something evil): They were plotting the death of the king.) hautoa2) (to make a plan, map, graph etc of: The navigator plotted the course of the ship.) kartoittaa
См. также в других словарях:
Graph coloring — A proper vertex coloring of the Petersen graph with 3 colors, the minimum number possible. In graph theory, graph coloring is a special case of graph labeling; it is an assignment of labels traditionally called colors to elements of a graph… … Wikipedia
Graph theory — In mathematics and computer science, graph theory is the study of graphs : mathematical structures used to model pairwise relations between objects from a certain collection. A graph in this context refers to a collection of vertices or nodes and … Wikipedia
Directed acyclic graph — An example of a directed acyclic graph In mathematics and computer science, a directed acyclic graph (DAG i … Wikipedia
Object Process Graph — An Object Process Graph (OPG) is a general purpose executable graph that incorporates every aspect of an application, including process, user interface, and database.[1][2][3] No programming language, tool, or database is required to handle any… … Wikipedia
Segmentation (image processing) — In computer vision, segmentation refers to the process of partitioning a digital image into multiple regions (sets of pixels). The goal of segmentation is to simplify and/or change the representation of an image into something that is more… … Wikipedia
Ordered graph — An ordered graph is a graph with a total order over its nodes. In an ordered graph, the parents of a node are the nodes that are joined to it and precede it in the ordering. More precisely, n is a parent of m in the ordered graph if and n < m … Wikipedia
Filter graph — A filter graph is used in multimedia processing. For example to capture video from a webcam. Filters take input, process it or change the input, and then output the process data. An example of a filter, would be a video codec that takes raw… … Wikipedia
Node graph architecture — is a type of software design which builds around modular node components which can be connected together to form a graph. Often the software s underlying node graph architecture is also exposed to the end user as a 2 dimensional visualization of… … Wikipedia
Signal-flow graph — A signal flow graph (SFG) is a special type of block diagram[1] and directed graph consisting of nodes and branches. Its nodes are the variables of a set of linear algebraic relations. An SFG can only represent multiplications and additions.… … Wikipedia
Bridge (graph theory) — A graph with 6 bridges (highlighted in red) An undirected connected graph with no cut … Wikipedia
Transparallel processing — is a form of processing, in computing or otherwise, in which items are processed simultaneously by one processor.Transparallel processing complements the three forms of processing called: * subserial processing, in which items are processed one… … Wikipedia
