| /external/srec/tools/grxmlcompile/ |
| grph.h | 3 * DESCRIPTION: Part of the SREC graph compiler project source files.
23 class Graph
26 Graph (const char *name)
36 ~Graph()
|
| /external/llvm/include/llvm/ADT/ |
| GraphTraits.h | 1 //===-- llvm/ADT/GraphTraits.h - Graph traits template ----------*- C++ -*-===//
11 // specialized by classes that want to be iteratable by generic graph iterators.
14 // graphs in a graph defined, inverse ordering...
23 // GraphTraits - This class should be specialized by different graph types...
30 // typedef NodeType - Type of Node in the graph
31 // typedef ChildIteratorType - Type used to iterate over children in graph
34 // Return the entry node of the graph
47 // nodes_iterator/begin/end - Allow iteration over all nodes in the graph
53 // graph, or you need to define it for a new graph type. Either that o
[all...] |
| /external/llvm/include/llvm/Analysis/ |
| DOTGraphTraitsPass.h | 30 Analysis *Graph;
32 Graph = &getAnalysis<Analysis>();
33 GraphName = DOTGraphTraits<Analysis*>::getGraphName(Graph);
35 ViewGraph(Graph, Name, Simple, Title);
57 Analysis *Graph;
63 Graph = &getAnalysis<Analysis>();
66 GraphName = DOTGraphTraits<Analysis*>::getGraphName(Graph);
70 WriteGraph(File, Graph, Simple, Title);
|
| /external/llvm/unittests/ADT/ |
| SCCIteratorTest.cpp | 19 /// Graph<N> - A graph with N nodes. Note that N can be at most 8.
21 class Graph {
24 Graph(const Graph&);
25 Graph& operator=(const Graph&);
32 /// NodeSubset - A subset of the graph's nodes.
40 assert(N <= sizeof(BitVector)*CHAR_BIT && "Graph too big!");
101 /// Nodes - The list of nodes for this graph
[all...] |
| /external/webkit/Source/JavaScriptCore/dfg/ |
| DFGGraph.h | 62 // === Graph ===
64 // The dataflow graph is an ordered vector of nodes.
67 class Graph : public Vector<Node, 64> {
|
| /external/llvm/include/llvm/CodeGen/PBQP/ |
| Graph.h | 1 //===-------------------- Graph.h - PBQP Graph ------------------*- C++ -*-===//
10 // PBQP Graph class.
25 /// PBQP Graph class.
27 class Graph {
139 inline void copyFrom(const Graph &other);
142 /// \brief Construct an empty PBQP graph.
143 Graph() : numNodes(0), numEdges(0) {}
145 /// \brief Copy construct this graph from "other". Note: Does not copy node
146 /// and edge data, only graph structure and costs
[all...] |
| /external/opencv/cvaux/src/ |
| cvlcm.cpp | 54 CvGraph* Graph;
163 // pLCM : in, information about graph
165 // Returns: pointer to graph node
196 // Purpose: Function create graph node
199 // pLCM : in, information about graph
200 // Returns: pointer to graph node
208 // Purpose: Function create graph edge
211 // pLCM : in, information about graph
212 // Returns: pointer to graph edge
223 // LCMNode : in, graph nod
[all...] |
| /external/opencv/cvaux/include/ |
| cvaux.h | 312 CvGraph* graph; member in struct:CvCliqueFinder
314 int N; //graph size
342 /*CVAPI(void) cvStartFindCliques( CvGraph* graph, CvCliqueFinder* finder, int reverse,
347 CVAPI(void) cvBronKerbosch( CvGraph* graph );*/
353 // Purpose: finds weight of subgraph in a graph
356 // graph - input graph.
364 // weight_vtx - optional vector of floats, with size = graph->total.
368 // that vertices of graph are inherited from CvGraphWeightedVtx.
369 // weight_edge - optional matrix of floats, of width and height = graph->total
[all...] |
