Searched refs:graph (Results 1 - 25 of 156) sorted by relevance

1234567

/macosx-10.9.5/CPANInternal-140/Graph-0.94/t/
H A Du_te_ea.t7 my $graph = Graph->new( undirected => 1 );
9 $graph->add_vertex("Berlin");
10 $graph->add_vertex("Bonn");
11 $graph->add_edge("Berlin","Bonn");
12 is ("$graph","Berlin=Bonn");
13 $graph->set_edge_attributes("Berlin", "Bonn", { color => "red" });
14 is ("$graph","Berlin=Bonn");
16 $graph = Graph->new( undirected => 1 );
18 $graph->add_vertex("Berlin");
19 $graph
[all...]
/macosx-10.9.5/tcl-102/tcl_ext/tklib/tklib/examples/plotchart/
H A Deditgraph.tcl12 variable graph
32 variable graph
35 toplevel .graph
36 wm title .graph "Editing series"
37 canvas .graph.c -width 400 -height 300
38 button .graph.ok -text OK -width 10 -command {::Editgraph::SaveSeries}
39 button .graph.cancel -text Cancel -width 10 -command {::Editgraph::CancelSeries}
40 grid .graph.c -
41 grid .graph.ok .graph
[all...]
/macosx-10.9.5/ruby-104/ruby/ext/tk/sample/tkextlib/blt/
H A Dgraph7.rb6 graph = Tk::BLT::Graph.new(:title=>"Scatter Plot\n#{length} points")
7 graph.xaxis_configure(:loose=>false, :title=>'X Axis Label')
8 graph.yaxis_configure(:title=>'Y Axis Label')
9 graph.legend_configure(:activerelief=>:sunken, :background=>'')
11 Tk::BLT::Table.add(Tk.root, graph, [0,0], :fill=>:both)
19 plot = Tk::BLT::PlotComponent::Element.new(graph, :symbol=>:square,
27 #graph.zoom_stack
28 #graph.crosshairs
29 #graph.active_legend
30 #graph
[all...]
H A Dgraph7b.rb6 graph = Tk::BLT::Graph.new(:title=>"Scatter Plot\n#{length} points")
7 graph.xaxis_configure(:loose=>false, :title=>'X Axis Label')
8 graph.yaxis_configure(:title=>'Y Axis Label')
9 graph.legend_configure(:activerelief=>:sunken, :background=>'')
11 Tk::BLT::Table.add(Tk.root, graph, [0,0], :fill=>:both)
20 plot = Tk::BLT::PlotComponent::Element.new(graph, :symbol=>:square,
28 #graph.zoom_stack
29 #graph.crosshairs
30 #graph.active_legend
31 #graph
[all...]
H A Dgraph7c.rb6 graph = Tk::BLT::Graph.new(:title=>"Scatter Plot\n#{length} points")
7 graph.xaxis_configure(:loose=>false, :title=>'X Axis Label')
8 graph.yaxis_configure(:title=>'Y Axis Label')
9 graph.legend_configure(:activerelief=>:sunken, :background=>'')
11 Tk::BLT::Table.add(Tk.root, graph, [0,0], :fill=>:both)
24 plot = Tk::BLT::PlotComponent::Element.new(graph, :symbol=>:square,
32 #graph.zoom_stack
33 #graph.crosshairs
34 #graph.active_legend
35 #graph
[all...]
H A Dplot1.rb5 graph = Tk::BLT::Graph.new.pack
6 plot = Tk::BLT::PlotComponent::Element.new(graph, :linewidth=>0, :label=>'foo')
H A Dplot1b.rb5 graph = Tk::BLT::Graph.new.pack
6 plot = graph.element_create
H A Dgraph7a.rb29 graph = Tk::BLT::Graph.new(:title=>"Scatter Plot\n#{length} points")
30 graph.xaxis_configure(:loose=>false, :title=>'X Axis Label')
31 graph.yaxis_configure(:title=>'Y Axis Label')
32 graph.legend_configure(:activerelief=>:sunken, :background=>'')
34 Tk::BLT::Table.add(Tk.root, graph, [0,0], :fill=>:both)
42 plot = Tk::BLT::PlotComponent::Element.new(graph, :symbol=>:square,
50 #graph.zoom_stack
51 #graph.crosshairs
52 #graph.active_legend
53 #graph
[all...]
H A Dbarchart5.rb8 TkOption.add('*graph.x.Title', 'X Axis Label')
9 TkOption.add('*graph.y.Title', 'Y Axis Label')
10 TkOption.add('*graph.title', 'A Simple Barchart')
11 TkOption.add('*graph.x.Font', 'Times 10')
12 TkOption.add('*graph.Element.Relief', :raised)
16 TkOption.add('*graph.LineMarker.color', 'yellow')
17 TkOption.add('*graph.Element.Background', 'white')
18 TkOption.add('*graph.Legend.activeForeground', 'pink')
21 TkOption.add('*graph.background', 'palegreen')
22 TkOption.add('*graph
[all...]
/macosx-10.9.5/JavaScriptCore-7537.78.1/dfg/
H A DDFGDominators.h45 void compute(Graph& graph);
50 void computeIfNecessary(Graph& graph) argument
54 compute(graph);
66 bool iterateForBlock(Graph& graph, BlockIndex);
H A DDFGDominators.cpp44 void Dominators::compute(Graph& graph) argument
48 ASSERT(graph.m_blocks[0]->m_predecessors.isEmpty());
50 unsigned numBlocks = graph.m_blocks.size();
64 if (!graph.m_blocks[i])
70 if (!graph.m_blocks[i] || graph.m_blocks[i]->m_predecessors.isEmpty())
80 changed |= iterateForBlock(graph, i);
86 changed |= iterateForBlock(graph, i);
92 bool Dominators::iterateForBlock(Graph& graph, BlockIndex i) argument
94 BasicBlock* block = graph
[all...]
H A DDFGPhase.h40 Phase(Graph& graph, const char* name) argument
41 : m_graph(graph)
82 bool runPhase(Graph& graph) argument
84 PhaseType phase(graph);
H A DDFGBasicBlockInlines.h37 templatePre typeParams templatePost inline Node* BasicBlock::appendNode(Graph& graph, SpeculatedType type valueParamsComma valueParams) \
39 Node* result = graph.addNode(type valueParamsComma valueArgs); \
H A DDFGPredictionInjectionPhase.cpp40 PredictionInjectionPhase(Graph& graph) argument
41 : Phase(graph, "prediction injection")
88 bool performPredictionInjection(Graph& graph) argument
91 return runPhase<PredictionInjectionPhase>(graph);
H A DDFGUnificationPhase.cpp40 UnificationPhase(Graph& graph) argument
41 : Phase(graph, "unification")
84 bool performUnification(Graph& graph) argument
87 return runPhase<UnificationPhase>(graph);
H A DDFGCFAPhase.cpp40 CFAPhase(Graph& graph) argument
41 : Phase(graph, "control flow analysis")
42 , m_state(graph)
140 bool performCFA(Graph& graph) argument
143 return runPhase<CFAPhase>(graph);
H A DDFGVariableAccessDataDump.cpp36 VariableAccessDataDump::VariableAccessDataDump(Graph& graph, VariableAccessData* data) argument
37 : m_graph(graph)
H A DDFGVirtualRegisterAllocationPhase.cpp39 VirtualRegisterAllocationPhase(Graph& graph) argument
40 : Phase(graph, "virtual register allocation")
143 bool performVirtualRegisterAllocation(Graph& graph) argument
146 return runPhase<VirtualRegisterAllocationPhase>(graph);
/macosx-10.9.5/ruby-104/ruby/ext/tk/lib/tkextlib/
H A Dblt.rb114 def self.active_legend(graph)
115 tk_call_without_enc('Blt_ActiveLegend', graph)
117 def self.crosshairs(graph)
118 tk_call_without_enc('Blt_Crosshairs', graph)
120 def self.zoom_stack(graph)
121 tk_call_without_enc('Blt_ZoomStack', graph)
123 def self.print_key(graph)
124 tk_call_without_enc('Blt_PrintKey', graph)
126 def self.closest_point(graph)
127 tk_call_without_enc('Blt_ClosestPoint', graph)
[all...]
/macosx-10.9.5/ruby-104/ruby/sample/
H A Dbiorhythm.rb56 :graph => true,
67 opts.on("-g", "--show-graph", TrueClass, "show graph (default)"){|v|
68 options[:graph] = v
71 options[:graph] = !v
73 opts.on("--days=DAYS", Integer, "graph range (only in effect for graph)"){|v|
88 ausgabeart = options[:graph] ? "g" : "v"
115 graph = "." * 51
116 graph[2
[all...]
/macosx-10.9.5/libstdcxx-60/include/c++/4.2.1/bits/
H A Dctype_base.h56 static const mask graph = _CTYPE_A | _CTYPE_D | _CTYPE_P; member in struct:ctype_base
69 static const mask graph = _A | _D | _P; member in struct:ctype_base
/macosx-10.9.5/tcl-102/tcl_ext/tcllib/tcllib/modules/struct/graph/
H A Darcshimmer.c1 /* struct::graph - critcl - layer 1 definitions.
18 "tcllib::struct::graph/critcl::arc",
80 ga_get_arc (G* g, Tcl_Obj* arc, Tcl_Interp* interp, Tcl_Obj* graph) argument
91 /* the int.rep can be invalidated upon graph deletion */
95 if (a->graph == g) {
97 fprintf (stderr, "cached: %p (%p - %p)\n", a, t, a->graph);
105 * graph. We go through the hash table.
125 ga_err_missing (interp, arc, graph);
H A Dnodeshimmer.c1 /* struct::graph - critcl - layer 1 definitions.
18 "tcllib::struct::graph/critcl::node",
80 gn_get_node (G* g, Tcl_Obj* node, Tcl_Interp* interp, Tcl_Obj* graph) argument
91 /* the int.rep can be invalidated upon graph deletion */
95 if (n->graph == g) {
97 fprintf (stderr, "cached: %p (%p - %p)\n", n, t, n->graph);
105 * graph. We go through the hash table.
125 gn_err_missing (interp, node, graph);
/macosx-10.9.5/misc_cmds-32/tsort/
H A Dtsort.c90 NODE *n_next; /* next node in graph */
105 NODE *graph, **cycle_buf, **longest_cycle; variable
163 /* parse input and build the graph */
207 * add an arc from node s1 to node s2 in the graph. If s1 or s2 are not in
208 * the graph, then add them.
245 /* Find a node in the graph (insert if not found) and return a pointer to it. */
282 if ((n->n_next = graph) != NULL)
283 graph->n_prevp = &n->n_next;
284 n->n_prevp = &graph;
285 graph
[all...]
/macosx-10.9.5/CPANInternal-140/Graph/lib/Graph/
H A DTransitiveClosure.pm64 Graph::TransitiveClosure - create and query transitive closure of graph
74 # Compute the transitive closure graph.
90 # You can check any graph for transitivity.
111 closure graph of a graph and optionally also the minimum paths
126 the returned object is not a graph; it is a graph plus other stuff. But
127 you should be able to use it as a graph plus a couple of methods inherited
151 The transitive closure matrix is stored as an attribute of the graph
152 called C<_tcm>, and any methods not found in the graph clas
[all...]

Completed in 223 milliseconds

1234567