Searches , social queries for CODE PROPERTY-GRAPH
Search references for CODE PROPERTY-GRAPH. Phrases containing CODE PROPERTY-GRAPH
See searches and references containing CODE PROPERTY-GRAPH!
Search references for CODE PROPERTY-GRAPH. Phrases containing CODE PROPERTY-GRAPH
See searches and references containing CODE PROPERTY-GRAPH!CODE PROPERTY-GRAPH
Representation of a computer program
code property graph (CPG) is a computer program representation that captures syntactic structure, control flow, and data dependencies in a property graph
Code_property_graph
Database using graph structures for queries
A graph database (GDB) is a database that uses graph structures for semantic queries with nodes, edges, and properties to represent and store data. A key
Graph_database
Topics referred to by the same term
Heidelberg CPG 359, the Cod. Pal. germ. 359 illustrated manuscript Code property graph, a computer program representation Consumer packaged goods, another
CPG
Sparse graph with strong connectivity
In graph theory, an expander graph is a sparse graph that has strong connectivity properties, quantified using vertex, edge or spectral expansion. Expander
Expander_graph
Infinite graph containing all countable graphs
In the mathematical field of graph theory, the Rado graph, Erdős–Rényi graph, or random graph is a countably infinite graph that can be constructed (with
Rado_graph
Graphical representation of a computer program or algorithm
In computer science, a control-flow graph (CFG) is a representation, using graph notation, of all paths that might be traversed through a function during
Control-flow_graph
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
Abstract syntax representing expressions as graphs
semantic graph (ASG) or term graph is a form of abstract syntax in which an expression of a formal or programming language is represented by a graph whose
Abstract_semantic_graph
Directed graph with no directed cycles
In mathematics, particularly graph theory, and computer science, a directed acyclic graph (DAG) is a directed graph with no directed cycles. That is, it
Directed_acyclic_graph
Cartesian product of complete graphs
the hypercube graph Qd. Hamiltonian paths in these graphs form Gray codes. Because Cartesian products of graphs preserve the property of being a unit
Hamming_graph
Measure of the structural complexity of a software program
program's source code. It was developed by Thomas J. McCabe, Sr. in 1976. Cyclomatic complexity is computed using the control-flow graph of the program
Cyclomatic_complexity
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
Methodic assignment of colors to elements of a graph
In graph theory, graph coloring is a methodic assignment of labels traditionally called "colors" to elements of a graph. The assignment is subject to certain
Graph_coloring
Graphs formed by a hypercube's edges and vertices
In graph theory, the hypercube graph Q n {\displaystyle Q_{n}} is the edge graph of the n {\displaystyle n} -dimensional hypercube, that is, it is the
Hypercube_graph
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
Spectral graph theory concept
spectral graph theory, a Ramanujan graph is a regular graph whose spectral gap is almost as large as possible (see extremal graph theory). Such graphs are
Ramanujan_graph
Linear error correcting code
flexible design method that is based on sparse Tanner graphs (specialized bipartite graphs). LDPC code ensembles have also been analyzed using methods from
Low-density_parity-check_code
File format
DOT is a graph description language, developed as a part of the Graphviz project. DOT graphs are typically stored as files with the .gv or .dot filename
DOT (graph description language)
DOT_(graph_description_language)
Format for expressing RDF statements in HTML documents
annotate data in web pages Open Graph protocol, a way to use RDFa to integrate web pages into the Facebook social graph Schema.org, search-engine supported
RDFa
Basic concept of graph theory
mathematics and computer science, connectivity is one of the basic concepts of graph theory: it asks for the minimum number of elements (nodes or edges) that
Connectivity_(graph_theory)
Directed graph representing dependencies
mathematics, computer science and digital electronics, a dependency graph is a directed graph representing dependencies of several objects towards each other
Dependency_graph
Concept in graph theory
In graph theory, a strongly regular graph (SRG) is a regular graph G = (V, E) with v vertices and degree k such that for some given integers λ , μ ≥ 0
Strongly_regular_graph
World Wide Web Consortium standard
applies. A property shape describes characteristics of graph nodes that can be reached via a specific path. A path can be a single predicate (property) or a
SHACL
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
In graph theory, the Games graph is the largest known locally linear strongly regular graph. Its parameters as a strongly regular graph are (729,112,1
Games_graph
Bivariegated graph Cage (graph theory) Cayley graph Circle graph Clique graph Cograph Common graph Complement of a graph Complete graph Cubic graph Cycle graph De
List_of_graph_theory_topics
Object-Graph Navigation Language (OGNL) was an open-source Expression Language (EL) for Java, which, while using simpler expressions than the full range
OGNL
Positive-definite integral set of repeated points with Abelian group-rank 24
vector then the two even lattices are isomorphic.) The Kneser neighborhood graph in 8n dimensions has a point for each even lattice, and a line joining two
Niemeier_lattice
Square matrix used to represent a graph or network
In graph theory and computer science, an adjacency matrix is a square matrix used to represent a finite graph. The elements of the matrix indicate whether
Adjacency_matrix
Class of undirected graphs defined from systems of sets
mathematics, Johnson graphs are a special class of undirected graphs defined from systems of sets. The vertices of the Johnson graph J ( n , k ) {\displaystyle
Johnson_graph
Undirected graph acted on by a vertex-transitive cyclic group of symmetries
In graph theory, a circulant graph is an undirected graph acted on by a cyclic group of symmetries which takes any vertex to any other vertex. It is sometimes
Circulant_graph
Graph database implemented in Java
development of the Graph Query Language (GQL), an ISO-standardized query language for property graphs, and is a founding member of the GraphQL Foundation,
Neo4j
Trail in a graph that visits each edge once
In graph theory, an Eulerian trail (or Eulerian path) is a trail in a finite graph that visits every edge exactly once (allowing for revisiting vertices)
Eulerian_path
Least-weight tree connecting graph vertices
graph theory, a minimum spanning tree (MST) or minimum weight spanning tree is a subset of the edges of a connected, edge-weighted undirected graph that
Minimum_spanning_tree
Type of error-correcting codes
coding theory, expander codes form a class of error-correcting codes that are constructed from bipartite expander graphs. Along with Justesen codes,
Expander_code
16-regular graph with 27 vertices and 216 edges
the mathematical field of graph theory, the Schläfli graph, named after Ludwig Schläfli, is a 16-regular undirected graph with 27 vertices and 216 edges
Schläfli_graph
Measuring the time or resources used by a section of a computer program
running system to verify certain properties Profile-guided optimization – Compiler optimization technique Static code analysis – Analysis of computer programs
Profiling (computer programming)
Profiling_(computer_programming)
Graph with a median for each three vertices
In graph theory, a division of mathematics, a median graph is an undirected graph in which every three vertices a {\displaystyle a} , b {\displaystyle
Median_graph
Task of computing complete subgraphs
is a monotone graph property, meaning that, if a clique exists in a given graph, it will exist in any supergraph. Because this property is monotone, there
Clique_problem
Algorithm to search the nodes of a graph
tree or graph data structures. The algorithm starts at the root node (selecting some arbitrary node as the root node in the case of a graph) and explores
Depth-first_search
Classification of algorithm
(see, for example, Reingold's algorithm for connectivity in undirected graphs). As Lipton states: This alone could be important and often is a great reason
Galactic_algorithm
Topics referred to by the same term
Go City Labeled property graphs, a widely used graph data model Local Land and Property Gazetteer (LLPG) National Land and Property Gazetteer (NLPG)
LPG
Set of unordered triples from a vertex set
the two-graph. A regular two-graph has the property that every pair of vertices lies in the same number of triples of the two-graph. Two-graphs have been
Two-graph
Tree representation of the abstract syntactic structure of source code
{X}}]_{s}} . Abstract semantic graph (ASG), also called term graph Composite pattern Control-flow graph Directed acyclic graph (DAG) Document Object Model
Abstract_syntax_tree
Argentine-born American mathematician
2018) and a researcher in algebraic topology, differential topology, graph theory, coding theory and combinatorial designs. He obtained a Licentiate degree
Italo_Jose_Dejter
Property of an intermediate representation in a compiler
compiler optimizations, by simplifying the properties of variables. For example, consider this piece of code: y := 1 y := 2 x := y Humans can see that
Static_single-assignment_form
Graph where each vertex has the same number of neighbors
In graph theory, a regular graph is a graph where each vertex has the same number of neighbors; i.e. every vertex has the same degree or valency. A regular
Regular_graph
Restructuring existing computer code without changing its external behavior
computer programming and software design, code refactoring is the process of restructuring existing source code—changing the factoring—without changing
Code_refactoring
Computer compiler optimization technique
as optimized code as the "global" approach, which operates over the whole compilation unit (a method or procedure for instance). Graph-coloring allocation
Register_allocation
Open-source data analytics cluster computing framework
Spark 1.6, GraphX has full support for property graphs (graphs where properties can be attached to edges and vertices). Like Apache Spark, GraphX initially
Apache_Spark
Open source column-oriented RDBMS
community extensions maintained by third parties, covering use cases from graph queries (SQL/PGQ) to Kafka integration and ML inference. A full list is
DuckDB
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
Sierpiński graphs (or Sierpiński networks) are a family of graphs defined by two parameters n and k, denoted S(n,k). These graphs have applications in
Sierpiński_graph
Algorithm for finding shortest paths
an algorithm for finding the shortest paths between nodes in a weighted graph, which may represent, for example, a road network. It was conceived by computer
Dijkstra's_algorithm
Functional programming language
ABC machine is an imperative abstract graph rewriting machine. It consists of a graph store to hold the Clean graph that is being rewritten and three stacks:
Clean_(programming_language)
Israeli theoretical computer scientist
computer scientist whose research topics have included property testing, expander graphs, coding theory, and randomized algorithms with sublinear time
Tali_Kaufman
Python library for graphs and networks
the structure of the graph in a intuitive and readable way The Spectral layout is based on the spectral properties of the graph's adjacency matrix. It
NetworkX
Graphical representation of energy flows in physical systems
A bond graph is a graphical representation of the energy flows through, and between physical dynamical systems including those in the electrical, mechanical
Bond_graph
Family of graphs based on the Fibonacci sequence
mathematical field of graph theory, the Fibonacci cubes or Fibonacci networks are a family of undirected graphs with rich recursive properties derived from its
Fibonacci_cube
Study of discrete mathematical structures
continuous functions). Objects studied in discrete mathematics include integers, graphs, and statements in logic. By contrast, discrete mathematics excludes topics
Discrete_mathematics
the problem of determining whether, given a directed graph G and two nodes s and t on that graph, there is a path from s to t. ST-connectivity can be
NL-complete
Computer science field
algorithms avoid ever explicitly constructing the graph for the FSM; instead, they represent the graph implicitly using a formula in quantified propositional
Model_checking
Representation of a graph as a path graph "thickened" by some amount
In graph theory, a path decomposition of a graph G is, informally, a representation of G as a "thickened" path graph, and the pathwidth of G is a number
Pathwidth
One-by-one assignment of colors to graph vertices
of graph coloring problems in mathematics and computer science, a greedy coloring or sequential coloring is a coloring of the vertices of a graph formed
Greedy_coloring
Managing versions of source code or data
Version control (also known as revision control, source control, and source code management) is the software engineering practice of controlling, organizing
Version_control
Mathematical concept in graph theory
dominating set) is a dominating set with the additional property that every vertex in the graph is dominated by exactly one vertex in the set. The efficient
Efficient_dominating_set
British-Canadian codebreaker and mathematician (1917–2002)
fields of graph theory and matroid theory. Tutte's research in the field of graph theory proved to be of remarkable importance. At a time when graph theory
W._T._Tutte
Shape made from cubes joined together
similarly-named notions of a dual polyhedron, and of the dual graph of a surface-embedded graph. Dual graphs have also been used to define and study special subclasses
Polycube
mathematics, a fibration of graphs, or graph fibration, is a homomorphism of directed graphs that satisfies a unique lifting property analogous to that of a
Fibrations_of_graphs
Graph algorithm
components algorithm is an algorithm in graph theory for finding the strongly connected components (SCCs) of a directed graph. It runs in linear time, matching
Tarjan's strongly connected components algorithm
Tarjan's_strongly_connected_components_algorithm
Abstraction of linear independence of vectors
theory borrows extensively from the terms used in both linear algebra and graph theory, largely because it is the abstraction of various notions of central
Matroid
Branch of discrete mathematics
possible graph which satisfies certain properties. For example, the largest triangle-free graph on 2n vertices is a complete bipartite graph Kn,n. Often
Combinatorics
User interface markup language
crucial. QML is also used with Qt3D to describe a 3D scene and a "frame graph" rendering methodology. A QML document describes a hierarchical object tree
QML
Graph where every edge is in one triangle
In graph theory, a locally linear graph is an undirected graph in which every edge belongs to exactly one triangle. Equivalently, for each vertex of the
Locally_linear_graph
Topics referred to by the same term
devices TI-84 Plus CE, "Color Enhancement", a version of the TI-84 Plus Graphing Calculator with a high-resolution color display Capillary electrophoresis
CE
Compiler that optimizes generated code
analysis, primarily depend on how certain properties of data are propagated by control edges in the control-flow graph. Some of these include: Common subexpression
Optimizing_compiler
Directed path algebra
constructed from a directed graph. Leavitt path algebras generalize Leavitt algebras and may be considered as algebraic analogues of graph C*-algebras. Leavitt
Leavitt_path_algebra
Hamiltonian paths in symmetric graphs The Oberwolfach problem on which 2-regular graphs have the property that a complete graph on the same number of vertices
List of unsolved problems in mathematics
List_of_unsolved_problems_in_mathematics
Eulerian, non-hamiltonian, tough graph
Harris graphs, enabling larger graphs while preserving their properties. Notable types include the minimal Hirotaka graph, the barnacle-free Lopez graph, and
Harris_graph
Fewest graph edges whose removal breaks all cycles
piece of code. The cyclomatic number of a hypergraph can be derived by its Levi graph, with the same cyclomatic number but reduced to a simple graph. It is
Cyclomatic_number
convert a bipartite graph to a maximum-cardinality matching Hungarian algorithm: algorithm for finding a perfect matching Prüfer coding: conversion between
List_of_algorithms
Permissive free software license
second at 13% in their sample of repositories. GitHub's 2025 Innovation Graph found that repositories under the MIT License account for about one-third
MIT_License
Graph layout on multiple half-planes
In graph theory, a book embedding is a generalization of planar embedding of a graph to embeddings in a book, a collection of half-planes all having the
Book_embedding
Graph formed by subdivision of triangles
planar 3-trees, the maximal planar chordal graphs, the uniquely 4-colorable planar graphs, and the graphs of stacked polytopes. They are named after Apollonius
Apollonian_network
Algorithm for binary prefix code
all the codes form a prefix code. By comparing F to the CDF of X, this property may be demonstrated graphically for Shannon–Fano–Elias coding. By definition
Shannon–Fano–Elias_coding
searches for deadlock states BCG (Binary Coded Graphs) is both a file format for storing very large graphs on disk (using efficient compression techniques)
Construction and Analysis of Distributed Processes
Construction_and_Analysis_of_Distributed_Processes
Ordering of binary values, used for positioning and error correction
and lead to new properties. Gray codes are also used in labelling the axes of Karnaugh maps since 1953 as well as in Händler circle graphs since 1958, both
Gray_code
In mathematics, and, in particular, in graph theory, a rooted graph is a graph in which one vertex has been distinguished as the root. Both directed and
Rooted_graph
Geometry with 7 points and 7 lines
particular graph is a connected cubic graph (regular of degree 3), has girth 6 and each part contains 7 vertices. It is the Heawood graph, the unique
Fano_plane
Method of analyzing variables in software
optimizations and program verification techniques. A program's control-flow graph (CFG) is used to determine those parts of a program to which a particular
Data-flow_analysis
Algorithms to complete a sudoku
the potential to solve a wider range of problems. Algorithms designed for graph colouring are also known to perform well with sudokus. It is also possible
Sudoku_solving_algorithms
Study of the properties of codes and their fitness
Coding theory is the study of the properties of codes and their respective fitness for specific applications. Codes are used for data compression, cryptography
Coding_theory
Programming paradigm based on asynchronous data streams
runtimes are represented by a graph that identifies the dependencies among the involved reactive values. In such a graph, nodes represent the act of computing
Reactive_programming
Collaborative multilingual knowledge graph
Wikidata is a collaboratively edited multilingual knowledge graph hosted by the Wikimedia Foundation. It is a source of open data released under the Creative
Wikidata
Set of "near" codewords in coding theory
In coding theory, a covering code is a set of elements (called codewords) in a space, with the property that every element of the space is within a fixed
Covering_code
Function in algebraic graph theory
chromatic polynomial is a graph polynomial studied in algebraic graph theory, a branch of mathematics. It counts the number of graph colorings as a function
Chromatic_polynomial
Free library software for graphs
can be used to generate graphs, compute centrality measures and path length based properties as well as graph components and graph motifs. It also can be
Igraph
In RDF, a blank node (also called bnode) is a node in an RDF graph representing a resource for which a URI or literal is not given. The resource represented
Blank_node
Algorithm for maximum cardinality matching
a bipartite graph as input and produces a maximum-cardinality matching as output — a set of as many edges as possible with the property that no two edges
Hopcroft–Karp_algorithm
HTML element
dynamically generated graphics. Some anticipated uses of canvas include building graphs, animations, games, and image composition. Interacting with the canvas involves
Canvas_element
travel, tourism, insurance
CODE PROPERTY-GRAPH
CODE PROPERTY-GRAPH
Female
Yiddish
(×”Ö¸×דֶע) Yiddish form for Hebrew Hadaccah, HODE means "myrtle tree."
Surname or Lastname
French (Côte)
French (Côte) : topographic name for someone who lived on a slope or riverbank, less often on the coast, from Old French coste (Latin costa ‘rib’, ‘side’, ‘flank’, also used in a transferred topographical sense). There are several places in France named with this word, and the surname may also be a habitational name from any of these.English : topographic name from Middle English cote, cott ‘shelter’, ‘cottage’ (see Coates).
Boy/Male
Welsh American Shakespearean
Small battle; spirit of the battle.
Surname or Lastname
English
English : variant spelling of Coad.
Surname or Lastname
Spanish and Portuguese
Spanish and Portuguese : nickname from the title of rank conde ‘count’, a derivative of Latin comes, comitis ‘companion’.English : unexplained.
Girl/Female
Tamil
Code
Girl/Female
Hindu
Code
Surname or Lastname
English
English : from a Middle English personal name, Cade, a survival of the Old English personal name or byname Cada, which is probably from a Germanic root meaning ‘lump’, ‘swelling’.English : metonymic occupational name for a cooper, from Middle English, Old French cade ‘cask’, ‘barrel’ (of Germanic origin, probably akin to the root mentioned in 1).English : nickname for a gentle or inoffensive person, from Middle English cade ‘domestic animal’, ‘pet’ (of unknown origin).French (Cadé) : topographic name from cade ‘juniper’ (from Latin catanus).Bearers of the name Caddé, from Amiens, were documented in Quebec city by 1670.
Male
English
 English surname transferred to forename use, derived from Old English Cola, COLE means "black, coal." This name is also sometimes used as a pet form of Nicholas, meaning "victor of the people."
Surname or Lastname
English
English : variant of Cook.Americanized spelling of German Koke or Koch.
Surname or Lastname
German
German : from a short form of any of the various Germanic personal names with the first element hrÅd ‘renown’. Compare Robert, Rudiger.North German, Danish, and English : topographic name for someone who lived on land cleared for cultivation or in a clearing in woodland, from Middle Low German rode, Danish rothe, Old English rod. Compare English Rhodes.English : habitational name from any of the many places named with this word, as for example Rode in Cheshire.Slovenian : topographic name from the adjective rod ‘barren’, denoting someone who lived on a barren land.Slovenian : nickname from the Slovenian dialect word rode ‘person with disheveled hair’, a derivative of rod ‘curly’ or ‘hairy’.
Surname or Lastname
English (common in the Midlands)
English (common in the Midlands) : from Middle English cope ‘cloak’, ‘cape’ (from Old English cÄp reinforced by the Old Norse cognate kápa), hence a metonymic occupational name for someone who made cloaks or capes, or a nickname for someone who wore a distinctive one. Compare Cape.
Male
English
Variant spelling of English unisex Cody, CODIE means "helper."
Surname or Lastname
English
English : habitational name from a place named Cove, examples of which are found in Devon, Hampshire, and Suffolk, from Old English cofa ‘cove’, ‘bay’, ‘inlet’, also ‘shelter’, ‘hut’, or a topographic name with the same meaning.
Boy/Male
Welsh
Dwells in the woods.
Boy/Male
Greek American English
People's victory.
Girl/Female
English American Irish
Cushion. Helpful.
Surname or Lastname
English
English : metonymic occupational name for a maker of purses and bags, from Middle English cod ‘bag’.English : nickname for a man noted for his apparent sexual prowess, from cod(piece), in Tudor times the garment worn prominently over the male genitals.English : from Middle English cod, the fish (of uncertain origin, perhaps a transferred use of 1), applied as a metonymic occupational name for a fisherman or seller of these fish, or possibly as a nickname for someone thought to resemble the fish in some way.Irish : variant of Cody.Irish (County Wexford) : from the Anglo-Saxon personal name Cod.
Surname or Lastname
English (Surrey)
English (Surrey) : unexplained. Compare Moad.
Surname or Lastname
English
English : from a Middle English pet form of Nicholas.English : from a Middle English personal name derived from the Old English byname Cola (from col ‘(char)coal’, presumably denoting someone of swarthy appearance), or the Old Norse cognate Koli.Scottish and Irish : when not of English origin, this is a reduced and altered form of McCool.In some cases, particularly in New England, Cole is a translation of the French surname Charbonneau.Probably an Americanized spelling of German Kohl.An Irish family by the name of Cole was established in Fermanagh by Sir William Cole (1576–1653). He was the first Provost of Enniskillen, and his descendants became earls of Enniskillen. The family is thought to have originated in Devon or Cornwall.
CODE PROPERTY-GRAPH
CODE PROPERTY-GRAPH
CODE PROPERTY-GRAPH
CODE PROPERTY-GRAPH
CODE PROPERTY-GRAPH
CODE PROPERTY-GRAPH
CODE PROPERTY-GRAPH
travel, tourism, insurance