Searches , social queries for OBJECT GRAPH
Search references for OBJECT GRAPH. Phrases containing OBJECT GRAPH
See searches and references containing OBJECT GRAPH!
Search references for OBJECT GRAPH. Phrases containing OBJECT GRAPH
See searches and references containing OBJECT GRAPH!OBJECT GRAPH
Network representation of the relationships between objects in a program
another object or through a chain of intermediate references. These groups of objects are referred to as object graphs, after the mathematical objects called
Object_graph
Vertices connected in pairs by edges
particularly in graph theory, a graph is a structure consisting of a set of objects where some pairs of the objects are in some sense "related". The objects are represented
Graph_(discrete_mathematics)
Java serialization library
to discover the structure of the object graph to serialize at run time, and doesn't require modifications to objects. It can serialize internal fields
XStream
Area of discrete mathematics
computer science, graph theory is the study of graphs, which are mathematical structures used to model pairwise relations between objects. A graph in this context
Graph_theory
Database using graph structures for queries
early 1990s. In 2000, the Object Data Management Group published a standard language for defining object and relationship (graph) structures in their ODMG'93
Graph_database
Form of data structure
inheritance or spatial representation of a set of objects. It is a collection of nodes in a graph or tree structure. A tree node may have many children
Scene_graph
Semantic instance with state, behavior, and identity
Distributed object Instance (computer science) Metaobject Method (computer programming) Object-capability model Object composition Object copying Object graph Object
Object_(computer_science)
Diagram showing the structure of objects in a system
specifications described object diagrams as such: "An object diagram is a graph of instances, including objects and data values. A static object diagram is an instance
Object_diagram
Type of knowledge base
knowledge graph is a knowledge base that uses a graph-structured data model or topology to represent and operate on data. Knowledge graphs are often used
Knowledge_graph
Fundamental unit of which graphs are formed
from which the graph arises; for instance, a semantic network is a graph in which the vertices represent concepts or classes of objects. The two vertices
Vertex_(graph_theory)
Directed graph representing dependencies
science and digital electronics, a dependency graph is a directed graph representing dependencies of several objects towards each other. It is possible to derive
Dependency_graph
Object-Graph Navigation Language (OGNL) was an open-source Expression Language (EL) for Java, which, while using simpler expressions than the full range
OGNL
Graph with oriented edges
In mathematics, and more specifically in graph theory, a directed graph (or digraph) is a graph that is made up of a set of vertices connected by directed
Directed_graph
Persistence framework provided by Apple in the macOS and iOS operating systems
Core Data is an object graph and persistence framework provided by Apple in the macOS and iOS operating systems. It was introduced in Mac OS X 10.4 Tiger
Core_Data
Appendix:Glossary of graph theory in Wiktionary, the free dictionary. This is a glossary of graph theory. Graph theory is the study of graphs, systems of nodes
Glossary_of_graph_theory
Software resource tracking technique
copying objects. When dealing with garbage collection schemes, it is often helpful to think of the reference graph, which is a directed graph where the
Reference_counting
Directed graph with no directed cycles
where the vertices can be any kind of object that is connected in pairs by edges. In the case of a directed graph, each edge has an orientation, from one
Directed_acyclic_graph
Maximal subgraph whose vertices can reach each other
In graph theory, a component of an undirected graph is a connected subgraph that is not part of any larger connected subgraph. The components of any graph
Component_(graph_theory)
Block of memory allocated by a program which has lost all references to it
can treat a weakly reachable object graph as unreachable and deallocate it. (Conversely, references that prevent an object from being garbage collected
Unreachable_memory
Graph that can be embedded in the plane
In graph theory, a planar graph is a graph that can be embedded in the plane, i.e., it can be drawn on the plane in such a way that its edges intersect
Planar_graph
graph has vertex set V/R and edge set {([u]R, [v]R) | (u, v) ∈ E(G)}. More formally, a quotient graph is a quotient object in the category of graphs.
Quotient_graph
Web page protocol for real-time updates
Facebook's global mapping/tracking tool Social Graph. These pages gain the functionality of other graph objects including profile links and stream updates
Open_Graph_protocol
Order-zero graph or any edgeless graph
mathematical field of graph theory, the term "null graph" may refer either to the order-zero graph, or alternatively, to any edgeless graph (the latter is sometimes
Null_graph
Unrelated vertices in graphs
In graph theory, an independent set, stable set, coclique or anticlique is a set of vertices in a graph, no two of which are adjacent. That is, it is a
Independent set (graph theory)
Independent_set_(graph_theory)
Data query language developed by Facebook
an object with fields that match the variable names in the mutation. { "name": "Han Solo", "age": 42 } Once the operation is complete, the GraphQL server
GraphQL
open source Enterprise Objects, one of the first commercial OR mappers, available as part of WebObjects Core Data, object graph management framework with
List of object–relational mapping software
List_of_object–relational_mapping_software
Programming paradigm based on objects
Object-oriented programming (OOP) is a programming paradigm based on objects – software entities that encapsulate data and function(s).[clarification needed]
Object-oriented_programming
Subgraph with contracted edges
In graph theory, an undirected graph H is called a minor of the undirected graph G if H can be formed from G by deleting edges and vertices and by contracting
Graph_minor
Bijection between the vertex set of two graphs
In graph theory, an isomorphism of graphs G and H is a bijection between the vertex sets of G and H f:V(G)→V(H) such that any two vertices u and v of G
Graph_isomorphism
Apple’s software subsystem for rendering and editing text
requirements that would arise if every field implemented its own NSTextView object graph when only one field can actually have focus at any time. Cocoa adopts
Cocoa_text_system
Mathematical model used by graph-oriented databases
and object-oriented modeling. By contrast, in RDF graphs, "properties" is the term for the arcs. This is why a clearer name is attributed graphs, or graphs
Property_graph
Abstract data type in computer science
science, a graph is an abstract data type that is meant to implement the undirected graph and directed graph concepts from the field of graph theory within
Graph_(abstract_data_type)
Representation of a mathematical function
In mathematics, the graph of a function f {\displaystyle f} is the set of ordered pairs ( x , y ) {\displaystyle (x,y)} , where f ( x ) = y . {\displaystyle
Graph_of_a_function
Computer hacking technique
vulnerabilities to include attacks targeting Object Relational Mapping (ORM) systems, Expression Language (EL), and Object Graph Navigation Library (OGNL). To address
SQL_injection
Node ordering for directed acyclic graphs
computer science, a topological sort or topological ordering of a directed graph is a linear ordering of its vertices such that for every directed edge (u
Topological_sorting
Extension of the RDF data model
the form subject predicate object, quads would have a form along the lines of subject predicate object context. Named graphs can be represented this way
Named_graph
Function type in graph theory
of dense graphs. Graphons arise both as a natural notion for the limit of a sequence of dense graphs, and as the fundamental defining objects of exchangeable
Graphon
Programming technique of receiving dependencies
construct and connect complex object graphs, where objects may be both clients and services. The injector itself may be many objects working together, but must
Dependency_injection
vs. time graph of an object is equal to the velocity of the object. In the International System of Units, the position of the moving object is measured
Motion_graphs_and_derivatives
Type of directed graph
The nearest neighbor graph (NNG) is a directed graph defined for a set of points in a metric space, such as the Euclidean distance in the plane. The NNG
Nearest_neighbor_graph
Technique in object-oriented programming
In object-oriented programming, object copying is creating a copy of an existing object, a unit of data in object-oriented programming. The resulting object
Object_copying
Binary serialization format
Message Format (AMF) is a binary format used to serialize object graphs such as ActionScript objects and XML, or send messages between an Adobe Flash client
Action_Message_Format
Formal language for describing data models
directed graph composed of triple statements. An RDF graph statement is represented by: (1) a node for the subject, (2) an arc from subject to object, representing
Resource Description Framework
Resource_Description_Framework
Optimization technique
As applied in the field of computer vision, graph cut optimization can be employed to efficiently solve a wide variety of low-level computer vision problems
Graph cuts in computer vision and artificial intelligence
Graph_cuts_in_computer_vision_and_artificial_intelligence
Process for converting data into a "standard", "normal", or canonical form
form – Standard representation of a mathematical object Graph canonization – Task in computational graph theory Lemmatisation – Natural language processing
Canonicalization
Graph representing tangency between geometric objects
mathematical area of graph theory, a contact graph or tangency graph is a graph whose vertices are represented by geometric objects (e.g. curves, line segments
Contact_graph
Data structure representing a graph
each vertex in a graph with an array of adjacent vertices. In this representation, a vertex may be represented by any hashable object. There is no explicit
Adjacency_list
Graph divided into two independent sets
In the mathematical field of graph theory, a bipartite graph (or bigraph) is a graph whose vertices can be divided into two disjoint and independent sets
Bipartite_graph
Direction towards infinity in infinite graphs
the mathematics of infinite graphs, an end of an undirected graph represents, intuitively, a direction in which the graph extends to infinity. Ends may
End_(graph_theory)
Design principle of receiving control flow from external source
is determined by objects that are statically bound to one another. With inversion of control, the flow depends on the object graph that is built up during
Inversion_of_control
Diagram of behavior of finite state systems
classic form of state diagram for a finite automaton (FA) is a directed graph with the following elements (Q, Σ, Z, δ, q0, F): Vertices Q: a finite set
State_diagram
Type of diagrammatic notation for propositional logic
An existential graph is a type of diagrammatic or visual notation for logical expressions, created by Charles Sanders Peirce, who wrote on graphical logic
Existential_graph
File format
acyclic graphs. At its simplest, DOT can be used to describe an undirected graph. An undirected graph shows simple relations between objects, such as
DOT (graph description language)
DOT_(graph_description_language)
Java web application server and framework originally developed by NeXT Software
and state management. It uses a template-based approach to take that object graph and turn it into HTML, or other tag-based information display standards
WebObjects
Algorithmically defined graph
In the study of graph algorithms, an implicit graph representation (or more simply implicit graph) is a graph whose vertices or edges are not represented
Implicit_graph
Two closely related models for generating random graphs
limit object of Gn as n→+∞. Rado graph – Infinite graph containing all countable graphs, the graph formed by extending the G(n, p) model to graphs with
Erdős–Rényi_model
Path in a graph that visits each vertex exactly once
the mathematical field of graph theory, a Hamiltonian path (or traceable path) is a path in an undirected or directed graph that visits each vertex exactly
Hamiltonian_path
File format for encoding linked data
JSON-LD (JavaScript Object Notation for Linked Data) is a method of encoding linked data using JSON and of serializing data similarly to traditional JSON
JSON-LD
Concept in graph theory
In graph theory, a vertex is incident with an edge if the vertex is one of the two vertices the edge connects. An incidence is a pair ( u , e ) {\displaystyle
Incidence_(graph)
Type of chart
graph from his The Commercial and Political Atlas to be the first bar chart in history. Diagrams of the velocity of a constantly accelerating object against
Bar_chart
Graph generated by a random process
In mathematics, random graph is the general term to refer to probability distributions over graphs. Random graphs may be described simply by a probability
Random_graph
Influence of local substructure of a graph on global properties
satisfy? A graph that is an optimal solution to such an optimization problem is called an extremal graph, and extremal graphs are important objects of study
Extremal_graph_theory
Planar movement within a Euclidean space without rotation
graph consisting of points ( x , f ( x − a ) ) {\displaystyle (x,f(x-a))} . Each point ( x , y ) {\displaystyle (x,y)} of the original graph corresponds
Translation_(geometry)
Physical simulation to visualize graphs
Force-directed graph drawing algorithms are a class of algorithms for drawing graphs in an aesthetically-pleasing way. Their purpose is to position the
Force-directed_graph_drawing
Edges that hit all cycles in a graph
In graph theory and graph algorithms, a feedback arc set or feedback edge set in a directed graph is a subset of the edges of the graph that contains at
Feedback_arc_set
Study of discrete mathematical structures
"continuous" (analogously to continuous functions). Objects studied in discrete mathematics include integers, graphs, and statements in logic. By contrast, discrete
Discrete_mathematics
Collection of objects and morphisms
each other. Any directed graph (or, more generally, a quiver) generates a small category: the objects are the vertices of the graph, and the morphisms are
Category_(mathematics)
Graph that encodes local operations in mathematics
mathematics, a flip graph is a graph whose vertices are combinatorial or geometric objects, and whose edges link two of these objects when they can be obtained
Flip_graph
Software development methodology
Object-oriented analysis and design (OOAD) is an approach to analyzing and designing a computer-based system by applying an object-oriented mindset and
Object-oriented analysis and design
Object-oriented_analysis_and_design
value-based queries and complex graph queries. InfiniteGraph goes beyond graph databases to also support complex object queries. Adoption is seen in federal
InfiniteGraph
Sequence of edges which join a sequence of vertices on a given graph
In graph theory, a path in a graph is a finite or infinite sequence of edges which joins a sequence of vertices which, by most definitions, are all distinct
Path_(graph_theory)
Set of unordered triples from a vertex set
two-graph is not a graph and should not be confused with other objects called 2-graphs in graph theory, such as 2-regular graphs. On the set of vertices
Two-graph
mathematical field of graph theory, a core is a notion that describes behavior of a graph with respect to graph homomorphisms. Graph C {\displaystyle C}
Core_(graph_theory)
Mathematical operation
respect to time. On the graph of a function, the sign of the second derivative is related to the concavity of the graph. The graph of a function with a positive
Second_derivative
Generalization of depth-first search trees
In graph theory, a Trémaux tree of an undirected graph G {\displaystyle G} is a type of spanning tree, generalizing depth-first search trees. They are
Trémaux_tree
Directed graph where every node has exactly one path to it from the root
a directed acyclic graph (DAG), but not every DAG is an arborescence. The term arborescence comes from French. Some authors object to it on grounds that
Arborescence_(graph_theory)
Trail in which only the first and last vertices are equal
In graph theory, a cycle in a graph is a non-empty trail in which only the first and last vertices are equal. A directed cycle in a directed graph is
Cycle_(graph_theory)
Database class for storage and retrieval of modeled data
type—document, key–value, wide-column, or graph—and the specific implementation. CAP theorem Comparison of object database management systems Comparison
NoSQL
Programming paradigm based on asynchronous data streams
of the data flow graph. For example, the observer pattern commonly describes data flows between whole objects/classes, whereas object-oriented reactive
Reactive_programming
apply performance optimizations to the code. AutoFetch can monitor the object graph usage so that if the usage changes, the tuning of the query can change
AutoFetch
Standard representation of a mathematical object
canonical, normal, or standard form of a mathematical object is a standard way of presenting that object as a mathematical expression. Often, it is one which
Canonical_form
Creating a new graph from an existing graph
computer science, graph transformation, or graph rewriting, concerns the technique of creating a new graph out of an original graph algorithmically. It
Graph_rewriting
Mapping of a graph into a tree
In graph theory, a tree decomposition is a mapping of a graph into a tree that can be used to define the treewidth of the graph and speed up solving certain
Tree_decomposition
topology and graph theory, a map is a subdivision of a surface such as the Euclidean plane into interior-disjoint regions, formed by embedding a graph onto the
Map_(graph_theory)
Psychoanalytic tool devised by Jacques Lacan
the two pathways in the graph of desire can be understood to connote interference and constraint. Desire for the primordial object is not fulfilled except
Graph_of_desire
Directed graph used for deadlock detection
A wait-for graph in computer science is a directed graph used for deadlock detection in operating systems and relational database systems. In computer
Wait-for_graph
Techniques used by computers to manage components with limited availability
resources held by objects in arbitrarily complicated relationships (a complicated object graph) are released transparently simply by object destruction (so
Resource management (computing)
Resource_management_(computing)
Partition of a graph into spanning subgraphs
mathematics In graph theory, a factor of a graph G is a spanning subgraph, i.e., a subgraph that has the same vertex set as G. A k-factor of a graph is a spanning
Graph_factorization
Software framework to support the development of websites
Another technique is that of graph traversal such as used by Zope, where a URL is decomposed in steps that traverse an object graph (of models and views).[citation
Web_framework
Graph whose embedding in a Euclidean space forms a regular tiling
In graph theory, a lattice graph, mesh graph, or grid graph is a graph whose drawing, embedded in some Euclidean space R n {\displaystyle \mathbb {R}
Lattice_graph
complex of a graph is a mathematical object describing the independent sets of the graph. Formally, the independence complex of an undirected graph G, denoted
Independence_complex
Software company
storing semantic relationships between objects. GraphDB is used to store and manage semantic knowledge graph data. It is built on top of the RDF4J architecture
Ontotext
Edge that connects a node to itself
In graph theory, a loop (also called a self-loop or a buckle) is an edge that connects a vertex to itself. A simple graph contains no loops. Depending
Loop_(graph_theory)
Combinatorial representation of a graph on an orientable surface
object by its boundaries. The concept of a combinatorial map was introduced informally by J. Edmonds for polyhedral surfaces which are planar graphs.
Combinatorial_map
ISO standard unique string identifier for a digital object
A digital object identifier (DOI) is a persistent identifier, or persistent handle, used to uniquely identify various objects, standardized by the International
Digital_object_identifier
Structure-preserving correspondence between node-link graphs
In the mathematical field of graph theory, a graph homomorphism is a mapping between two graphs that respects their structure. More concretely, it is a
Graph_homomorphism
On tangency patterns of circles
intersection graphs of interior-disjoint geometric objects are called tangency graphs or contact graphs. As a special case, the coin graphs of packings
Circle_packing_theorem
24-vertex symmetric bipartite cubic graph
In the mathematical field of graph theory, the Nauru graph is a symmetric, bipartite, cubic graph with 24 vertices and 36 edges. It was named by David
Nauru_graph
Abstract model
Description Language (DFDL) Distributional–relational database JC3IEDM Object graph Process model Paul R. Smith & Richard Sarfaty Publications, LLC 2009
Data_model
Association of one output to each input
Set function Simple function This definition of "graph" refers to a set of pairs of objects. Graphs, in the sense of diagrams, are most applicable to
Function_(mathematics)
travel, tourism, insurance
OBJECT GRAPH
OBJECT GRAPH
OBJECT GRAPH
OBJECT GRAPH
OBJECT GRAPH
OBJECT GRAPH
OBJECT GRAPH
OBJECT GRAPH
OBJECT GRAPH
travel, tourism, insurance