AI & ChatGPT searches , social queriess for CALL GRAPH
Search references for CALL GRAPH. Phrases containing CALL GRAPH
See searches and references containing CALL GRAPH!
Search references for CALL GRAPH. Phrases containing CALL GRAPH
See searches and references containing CALL GRAPH!CALL GRAPH
Structure in computing
A call graph (also known as a call multigraph) is a control-flow graph, which represents calling relationships between subroutines in a computer program
Call_graph
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
Vertices connected in pairs by edges
In discrete mathematics, particularly in graph theory, a graph is a structure consisting of a set of objects where some pairs of the objects are in some
Graph_(discrete_mathematics)
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
Standard UNIX utility
Sort (Unix) Make (software) Topological sorting List of Unix commands Call graph From 1997 until 2024, the POSIX version of the tsort program accepted
Tsort
Measuring the time or resources used by a section of a computer program
average call times, from the calls, and do not break down the call times based on the callee or the context. Call graph profilers show the call times,
Profiling (computer programming)
Profiling_(computer_programming)
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
Graph with oriented edges
specifically in graph theory, a directed graph (or digraph) is a graph that is made up of a set of vertices connected by directed edges, often called arcs. In
Directed_graph
GNU profiling tool
version of the older "prof" tool. Unlike prof, gprof is capable of limited call graph collecting and printing. GPROF was originally written by a group led by
Gprof
Computer compiler optimization technique
(global register allocation), or across function boundaries traversed via call-graph (interprocedural register allocation). When done per function/procedure
Register_allocation
Undirected, connected, and acyclic graph
In graph theory, a tree is an undirected graph in which every pair of distinct vertices is connected by exactly one path, or equivalently, a connected
Tree_(graph_theory)
Topics referred to by the same term
Look up Graph, graph, or -graph in Wiktionary, the free dictionary. Wikimedia Commons has media related to Graphs. Graph may refer to: Graph (discrete
Graph
combinatorics, in the area of random graphs. These graphs are also called multiply rooted graphs. The terms rooted directed graph or rooted digraph also see variation
Rooted_graph
Matrix representation of a graph
In the mathematical field of graph theory, the Laplacian matrix, also called the graph Laplacian, admittance matrix, Kirchhoff matrix, or discrete Laplacian
Laplacian_matrix
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
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)
Trail in which only the first and last vertices are equal
A graph without cycles is called an acyclic graph. A directed graph without directed cycles is called a directed acyclic graph. A connected graph without
Cycle_(graph_theory)
Number of edges touching a vertex in a graph
In graph theory, the degree (or valency) of a vertex of a graph is the number of edges that are incident to the vertex; in a multigraph, a loop contributes
Degree_(graph_theory)
Graph that can be embedded in the plane
other. Such a drawing is called a plane graph, or a planar embedding of the graph. A plane graph can be defined as a planar graph with a mapping from every
Planar_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
Subroutines in computer science
call graph of the program. Usually, most non-leaf routines call more than one other function. When this is the case, the majority of function calls in
Leaf_routine
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
Graph with nodes connected in a closed chain
In graph theory, a cycle graph or circular graph is a graph that consists of a single cycle, or in other words, some number of vertices (at least 3, if
Cycle_graph
Subgraph with contracted edges
In graph theory, an undirected graph H is called a minor of the graph G if H can be formed from G by deleting edges and vertices and by contracting edges
Graph_minor
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
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
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
Graph with all vertices of degree 3
of graph theory, a cubic graph is a graph in which all vertices have degree three. In other words, a cubic graph is a 3-regular graph. Cubic graphs are
Cubic_graph
Order-zero graph or any edgeless graph
graph theory, the term "null graph" may refer either to the order-zero graph, or alternatively, to any edgeless graph (the latter is sometimes called
Null_graph
Graph where all long cycles have a chord
rigid circuit graphs or triangulated graphs: a chordal completion of a graph is typically called a triangulation of that graph. Chordal graphs are a subset
Chordal_graph
Cubic graph with 10 vertices and 15 edges
bridgeless graph has a cycle-continuous mapping to the Petersen graph. More unsolved problems in mathematics In the mathematical field of graph theory, the
Petersen_graph
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
Python module
graph-tool is a Python module for manipulation and statistical analysis of graphs (AKA networks). The core data structures and algorithms of graph-tool
Graph-tool
During compilation, selecting which implementation of a method or function to use
traced through the call graph, in order to instantiate specific versions of generic functions, and select specific function calls based on the supplied
Static_dispatch
Computer science algorithm
computer science, graph traversal (also known as graph search) refers to the process of visiting (checking and/or updating) each vertex in a graph. Such traversals
Graph_traversal
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
Bijection between the vertex set of two graphs
a mapping of a graph onto itself, i.e., when G and H are one and the same graph, the isomorphism is called an automorphism of G. Graph isomorphism is
Graph_isomorphism
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)
Graph where each vertex has the same number of neighbors
degree k is called a k‑regular graph or regular graph of degree k. Regular graphs of degree at most 2 are easy to classify: a 0-regular graph consists of
Regular_graph
Graph representing edges of another graph
In the mathematical discipline of graph theory, the line graph of an undirected graph G is another graph L(G) that represents the adjacencies between edges
Line_graph
Network representation of the relationships between objects in a program
objects are referred to as object graphs, after the mathematical objects called graphs studied in graph theory. An object graph is a view of an object system
Object_graph
Examining the embedded components of software
code. This approach, pioneered by Asankhaya Sharma and colleagues, uses call graph analysis to trace execution paths from application entry points to
Software_composition_analysis
Flow graph invented by Claude Shannon
A signal-flow graph or signal-flowgraph (SFG), invented by Claude Shannon, but often called a Mason graph after Samuel Jefferson Mason who coined the
Signal-flow_graph
Open source routing engine
Topography Mission is used. The front-end is open-source too and called GraphHopper Maps. GraphHopper can be configured to use different algorithms such as
GraphHopper
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
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
Data query language developed by Facebook
or modified. A GraphQL server can process a client query using data from separate sources and present the results in a unified graph. The language is
GraphQL
Measurement of graph sparsity
In graph theory, a k-degenerate graph is an undirected graph in which every subgraph has at least one vertex of degree at most k {\displaystyle k} . That
Degeneracy_(graph_theory)
Dimensionality reduction of graph-based semantic data objects [machine learning task]
In representation learning, knowledge graph embedding (KGE), also called knowledge representation learning (KRL), or multi-relation learning, is a machine
Knowledge_graph_embedding
Franklin graph Frucht graph Goldner–Harary graph Golomb graph Grötzsch graph Harries graph Harries–Wong graph Herschel graph Hoffman graph Hofman Graph H(12
List_of_graphs
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
Mathematical game/problem
a graph. The geometric formulation is sometimes called continuous pursuit–evasion, and the graph formulation discrete pursuit–evasion (also called graph
Pursuit–evasion
Linear algebra aspects of graph theory
associated to the graph, such as the Colin de Verdière number. Two graphs are called cospectral or isospectral if the adjacency matrices of the graphs are isospectral
Spectral_graph_theory
Assignment of labels to elements of a graph
a graph G = (V, E), a vertex labeling is a function of V to a set of labels; a graph with such a function defined is called a vertex-labeled graph. Likewise
Graph_labeling
Directed graph where every node has exactly one path to it from the root
In graph theory, an arborescence is a directed graph where there exists a vertex r (called the root) such that, for any other vertex v, there is exactly
Arborescence_(graph_theory)
Planar graph with 5 nodes and 6 edges
mathematical field of graph theory, the butterfly graph (also called the bowtie graph and the hourglass graph) is a planar, undirected graph with 5 vertices
Butterfly_graph
Maximal subgraph whose vertices can reach each other
of the whole graph. Components are sometimes called connected components. The number of components in a given graph is an important graph invariant, and
Component_(graph_theory)
Graph whose biconnected components are all cliques
Block graphs are sometimes erroneously called Husimi trees (after Kôdi Husimi), but that name more properly refers to cactus graphs, graphs in which
Block_graph
Basic concept of graph theory
connectivity of a graph is an important measure of its resilience as a network. In an undirected graph G, two vertices u and v are called connected if G
Connectivity_(graph_theory)
Type of chart
A bar chart or bar graph is a chart or graph that presents categorical data with rectangular bars with heights or lengths proportional to the values that
Bar_chart
Function graph representing factorization
generalize constraint graphs. A factor whose value is either 0 or 1 is called a constraint. A constraint graph is a factor graph where all factors are
Factor_graph
Subdivision of vertices into disjoint sets
In mathematics, a graph partition is the reduction of a graph to a smaller graph by partitioning its set of nodes into mutually exclusive groups. Edges
Graph_partition
On tangency patterns of circles
whose interiors are disjoint. The intersection graph of a circle packing, called a coin graph, is the graph having a vertex for each circle, and an edge
Circle_packing_theorem
Graph made from disjoint union of complete graphs
In graph theory, a branch of mathematics, a cluster graph is a graph formed from the disjoint union of complete graphs. Equivalently, a graph is a cluster
Cluster_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
Undirected graph with no non-trivial symmetries
In graph theory, a branch of mathematics, an undirected graph is called an asymmetric graph if it has no nontrivial symmetries. Formally, an automorphism
Asymmetric_graph
In polytope theory, the edge graph (also known as vertex-edge graph or just graph) of a polytope is a combinatorial graph whose vertices and edges correspond
Graph_of_a_polytope
Sequence of edges which join a sequence of vertices on a given graph
are distinct, so are the edges). A directed path (sometimes called dipath) in a directed graph is a finite or infinite sequence of edges which joins a sequence
Path_(graph_theory)
Graph representing faces of another graph
mathematical discipline of graph theory, the dual graph of a planar graph G is a graph that has a vertex for each face of G. The dual graph has an edge for each
Dual_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
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)
Undirected graph acted on by a vertex-transitive cyclic group of symmetries
to any other vertex. It is sometimes called a cyclic graph, but this term has other meanings. Circulant graphs can be described in several equivalent
Circulant_graph
Set of edges without common vertices
In the mathematical discipline of graph theory, a matching or independent edge set in an undirected graph is a set of edges without common vertices. In
Matching_(graph_theory)
Operation in graph theory
In graph theory, the Cartesian product G □ H of graphs G and H is a graph such that: the vertex set of G □ H is the Cartesian product V(G) × V(H); and
Cartesian_product_of_graphs
Visualization of node-link graphs
Graph drawing is an area of mathematics and computer science combining methods from geometric graph theory and information visualization to derive two-dimensional
Graph_drawing
Graph in which every two vertices are adjacent
In the mathematical field of graph theory, a complete graph is a simple undirected graph in which every pair of distinct vertices is connected by a unique
Complete_graph
Bipartite graph where each node of 1st set is linked to all nodes of 2nd set
In the mathematical field of graph theory, a complete bipartite graph or biclique is a special kind of bipartite graph where every vertex of the first
Complete_bipartite_graph
On bipartite matching and vertex cover
In the mathematical area of graph theory, Kőnig's theorem, proved by Dénes Kőnig (1931), describes an equivalence between the maximum matching problem
Kőnig's theorem (graph theory)
Kőnig's_theorem_(graph_theory)
Computer program used to develop another program
targets Version control system – Stores and tracks versions of files Call graph – Structure in computing Comparison of integrated development environments –
Programming_tool
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
Two closely related models for generating random graphs
the mathematical field of graph theory, the Erdős–Rényi models are two closely related models for generating random graphs and the evolution of a random
Erdős–Rényi_model
Graph with tight clique-coloring relation
In graph theory, a perfect graph is a graph in which the chromatic number equals the size of the maximum clique, both in the graph itself and in every
Perfect_graph
Type of graph related to pursuit–evasion
a graph or stay put, until the cop lands on the robber's vertex. Finite cop-win graphs are also called dismantlable graphs or constructible graphs, because
Cop-win_graph
Triangle-free graph requiring four colors
Grötzsch graph is sometimes also called the Mycielski graph or the Mycielski–Grötzsch graph. Unlike later graphs in this sequence, the Grötzsch graph is the
Grötzsch_graph
Edge whose deletion would disconnect a graph
In graph theory, a bridge, isthmus, cut-edge, or cut arc is an edge of a graph whose deletion increases the graph's number of connected components. Equivalently
Bridge_(graph_theory)
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
Graph able to be partitioned into multiple independent sets
In graph theory, a part of mathematics, a k-partite graph is a graph whose vertices are (or can be) partitioned into k different independent sets. Equivalently
Multipartite_graph
Graph representing social relations
social graph is a graph that represents social relations between entities. It is a model or representation of a social network. The social graph has been
Social_graph
Influence of local substructure of a graph on global properties
has to satisfy? A graph that is an optimal solution to such an optimization problem is called an extremal graph, and extremal graphs are important objects
Extremal_graph_theory
Mathematical tree of cycles
In graph theory, a cactus (sometimes called a cactus tree) is a connected graph in which any two simple cycles have at most one vertex in common. Equivalently
Cactus_graph
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
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
Assignment of colors to edges of a graph
of a given graph is called the chromatic index of the graph. By Vizing's theorem, the number of colors needed to edge color a simple graph is either its
Edge_coloring
Graph of short distances in another graph
In graph theory, a branch of mathematics, the kth power Gk of an undirected graph G is another graph that has the same set of vertices, but in which two
Graph_power
Graph in which all ordered pairs of linked nodes are automorphic
direction). Such a graph is sometimes also called 1-arc-transitive or flag-transitive. By definition (ignoring u1 and u2), a symmetric graph without isolated
Symmetric_graph
Cubic graph with 8 vertices and 12 edges
mathematical field of graph theory, the Wagner graph is a 3-regular graph with 8 vertices and 12 edges. It is the 8-vertex Möbius ladder graph. As a Möbius ladder
Wagner_graph
Graph with nodes connected linearly
In the mathematical field of graph theory, a path graph (or linear graph) is a graph whose vertices can be listed in the order v1, v2, ..., vn such that
Path_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
Planar, undirected graph with 2n vertices and 3n-2 edges
mathematical field of graph theory, the ladder graph Ln is a planar, undirected graph with 2n vertices and 3n − 2 edges. The ladder graph can be obtained as
Ladder_graph
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
CALL GRAPH
CALL GRAPH
Boy/Male
Shakespearean
A Midsummer Night's Dream' Snout, a tinker, acts as Wall in the play within the play.
Surname or Lastname
English
English : topographic name for someone who lived by a stone-built wall, e.g. one used to fortify a town or to keep back the encroachment of the sea (Old English w(e)all, from Latin vallum ‘rampart’, ‘palisade’).Northern English : topographic name for someone who lived by a spring or stream, northern Middle English wall(e) (Old English (Mercian) wæll(a); compare Well).Irish : re-Anglicized form of de Bhál, a Gaelicized form of de Valle, the name of a Norman family established in Munster and Connacht.German : topographic name for someone who lived by a defensive wall, Middle High German wal.German : variant of Wahl 2.German : from a short form of the personal name Walther.Swedish : ornamental name from Swedish vall ‘grassy bank’, ‘pasture’, ‘grazing ground’, or in some cases a habitational name from a place named with this element.
Surname or Lastname
English, Scottish, Irish, German, and Scandinavian
English, Scottish, Irish, German, and Scandinavian : from Middle English hall (Old English heall), Middle High German halle, Old Norse hǫll all meaning ‘hall’ (a spacious residence), hence a topographic name for someone who lived in or near a hall or an occupational name for a servant employed at a hall. In some cases it may be a habitational name from places named with this word, which in some parts of Germany and Austria in the Middle Ages also denoted a salt mine. The English name has been established in Ireland since the Middle Ages, and, according to MacLysaght, has become numerous in Ulster since the 17th century.Hall is one of the commonest and most widely distributed of English surnames, bearing witness to the importance of the hall as a feature of the medieval village.
Surname or Lastname
English, Dutch, German, and Scandinavian
English, Dutch, German, and Scandinavian : variant of Carl.
Surname or Lastname
Scottish or Irish
Scottish or Irish : reduced form of McFall.English : topographic name for someone who lived by a waterfall, declivity, or forest clearing, Middle English fall (from Old English (ge)fall ‘a felling of trees’, Old Norse fall ‘forest clearing’).German : topographic name from Middle High German val ‘fall (of trees)’; in some cases ‘waterfall’ or ‘landslide’, or a habitational name from a minor place named with this word, or in Tyrol from Ladine val ‘valley’.African : unexplained.
Surname or Lastname
Irish
Irish : reduced form of McCall.English : from Middle English calle ‘close-fitting cap for women’ (from Old French cale), probably applied as a metonymic occupational name. Compare Cale.Catalan : topographic name from call ‘narrow track’ (Latin callis). Compare Calle.Possibly an Americanized spelling of German Koll or Goll.
Boy/Male
English American German
Man. Famous Bearer: astronomer Carl Sagan.
Boy/Male
Christian & English(British/American/Australian)
From the Hall or Manor
Surname or Lastname
English
English : from the medieval female personal name Mal(le), pet form of Mary (see Marie).Indian (northern states) : Hindu name found in several communities, from Sanskrit malla ‘strongman’, ‘wrestler’.
Surname or Lastname
English
English : from the Old English personal name Cula.Americanized spelling of German and Swedish Kall or German Koll.
Surname or Lastname
English
English : nickname for a short, fat person, from Middle English bal(le) ‘ball’ (Old English ball, Old Norse b{o,}llr).English : topographic name for someone who lived on or by a knoll or rounded hill, from the same Middle English word, bal(le), used in this sense.English : from the Old Norse personal name Balle, derived either from ballr ‘dangerous’ or b{o,}llr ‘ball’.South German : from Middle High German bal ‘ball’, possibly applied as a metonymic occupational name for a juggler, or a habitational name from a place so named in the Rhine area.Dutch and German : short form of any of various Germanic personal names formed with the element bald (see Bald).William Ball (1616–80) emigrated from Suffolk, England, to VA about 1650 and was one of the founders of Millenbeck on the Rappahannock.
Surname or Lastname
English
English : from a reduced form of the personal name Nicholas.Scottish or Irish : reduced form of McColl.Catalan : topographic name from coll ‘mountain pass’, from Latin collis ‘hill’.Americanized spelling of German Koll or Kohl.
Boy/Male
English American
Bald; Abbreviation of names beginning with Cal-.
Female
English
English name derived from the name of the Calla Lily, from Greek kallaia, CALLA means "wattle of a cock," from kallos meaning "beauty."Â
Boy/Male
American, Arabic, Australian, British, Christian, English, Hebrew, Latin
Courageous; Adorable; Well Known; Awesome; Little Bald One; Hairless; Short for Names Beginning with Cal
Surname or Lastname
Variant spelling of Dutch, German, and Scandinavian Karl.English
Variant spelling of Dutch, German, and Scandinavian Karl.English : from the Anglo-Scandinavian personal name Karl(i), ultimately from Germanic karl ‘man’, ‘freeman’. See also Charles.English : status name for a bondman or villein, from the vocabulary word karl, carl, which had various different meanings at various times: originally ‘man’, then ‘ordinary man’, ‘peasant’, and in Middle English specialized in the senses ‘free peasant’, ‘bondman’, ‘villein’, and ‘rough, churlish individual’.
Male
English
 English surname transferred to forename use, derived from Old English heall "hall," hence "lives at the hall." Middle English name HALL means "to cover, conceal."
Male
English
Older spelling of German Karl, CARL means "man."Â
Male
English
Short form of English Caleb, CALE means "dog" or "rabid."
Surname or Lastname
English
English : nickname for a respectable or decent person, or else a good-looking one, both these senses belonging to Middle English tall (Old English getæl ‘swift’, ‘prompt’). The modern sense ‘of high stature’ did not develop until the end of the 16th century; the usual Middle English equivalents were Long and High.
CALL GRAPH
CALL GRAPH
Girl/Female
Indian
Fragrance
Surname or Lastname
English
English : unexplained; probably of French origin (see 2).Respelling of French Gambrelle, a reduced form of Gambarelle, a nickname denoting someone with long legs, from a derivative of gambe, Norman and Picard form of jambe ‘leg’.
Girl/Female
Hindu, Indian
Free from Guile
Girl/Female
English Latin American Italian
Light.
Surname or Lastname
English
English : probably a variant of Barrows.
Girl/Female
Greek Latin
A Fate.
Surname or Lastname
English (of Norman origin)
English (of Norman origin) : habitational name from any of various places in France named Gournay, notably Gournay-en-Brai in Seine-Maritime.
Boy/Male
Irish
Happy.
Boy/Male
Indian
Descendent, Successor
Girl/Female
British, English
Bright Fame
CALL GRAPH
CALL GRAPH
CALL GRAPH
CALL GRAPH
CALL GRAPH
n.
To make calm; to render still or quiet, as elements; as, to calm the winds.
n.
The gall bladder.
v. t.
To inclose with a wall, or as with a wall.
n.
The cry of a bird; also a noise or cry in imitation of a bird; or a pipe to call birds by imitating their note or cry.
n.
That which falls; a falling; as, a fall of rain; a heavy fall of snow.
n. & a.
See Pall-mall.
v. t.
To invite or command to meet; to convoke; -- often with together; as, the President called Congress together; to appoint and summon; as, to call a meeting of the Board of Aldermen.
n.
The act of calling; -- usually with the voice, but often otherwise, as by signs, the sound of some instrument, or by writing; a summons; an entreaty; an invitation; as, a call for help; the bugle's call.
v. t.
To utter in a loud or distinct voice; -- often with off; as, to call, or call off, the items of an account; to call the roll of a military company.
n.
A game formerly common in England, in which a wooden ball was driven with a mallet through an elevated hoop or ring of iron. The name was also given to the mallet used, to the place where the game was played, and to the street, in London, still called Pall Mall.
n.
Diminution or decrease in price or value; depreciation; as, the fall of prices; the fall of rents.
v. t.
To place or inclose in a cell.
n.
See Pall-mall.
n.
An old game played with malls or mallets and balls. See Pall-mall.
v. t.
To command or request to come or be present; to summon; as, to call a servant.
v. t.
To form or wind into a ball; as, to ball cotton.
v. t.
To pass somewhat suddenly, and passively, into a new state of body or mind; to become; as, to fall asleep; to fall into a passion; to fall in love; to fall into temptation.
n.
A short visit; as, to make a call on a neighbor; also, the daily coming of a tradesman to solicit orders.
v. t.
To state, or estimate, approximately or loosely; to characterize without strict regard to fact; as, they call the distance ten miles; he called it a full day's work.
v. t.
To let fall; to drop.