Lines Matching refs:graph
44 Graph<int> graph; in TEST() local
45 graph.AddVertex(0); in TEST()
46 graph.AddVertex(1); in TEST()
47 graph.AddVertex(2); in TEST()
48 graph.AddVertex(3); in TEST()
49 graph.AddVertex(4); in TEST()
51 graph.AddEdge(0, 1); in TEST()
52 graph.AddEdge(1, 2); in TEST()
53 graph.AddEdge(2, 3); in TEST()
54 graph.AddEdge(3, 4); in TEST()
59 int independent_set_size = IndependentSetOrdering(graph, &ordering); in TEST()
74 Graph<int> graph; in TEST() local
75 graph.AddVertex(0); in TEST()
76 graph.AddVertex(1); in TEST()
77 graph.AddVertex(2); in TEST()
78 graph.AddVertex(3); in TEST()
79 graph.AddVertex(4); in TEST()
81 graph.AddEdge(0, 1); in TEST()
82 graph.AddEdge(0, 2); in TEST()
83 graph.AddEdge(0, 3); in TEST()
84 graph.AddEdge(0, 4); in TEST()
93 int independent_set_size = IndependentSetOrdering(graph, &ordering); in TEST()
105 Graph<int> graph; in TEST() local
106 graph.AddVertex(0, 1.0); in TEST()
107 graph.AddVertex(1, 2.0); in TEST()
108 graph.AddEdge(0, 1, 0.5); in TEST()
109 graph.AddEdge(1, 0, 0.5); in TEST()
111 scoped_ptr<Graph<int> > forest(Degree2MaximumSpanningForest(graph)); in TEST()
122 Graph<int> graph; in TEST() local
123 graph.AddVertex(0); in TEST()
124 graph.AddVertex(1); in TEST()
125 graph.AddVertex(2); in TEST()
126 graph.AddVertex(3); in TEST()
127 graph.AddVertex(4); in TEST()
129 graph.AddEdge(0, 1, 1.0); in TEST()
130 graph.AddEdge(0, 2, 2.0); in TEST()
131 graph.AddEdge(0, 3, 3.0); in TEST()
132 graph.AddEdge(0, 4, 4.0); in TEST()
134 scoped_ptr<Graph<int> > forest(Degree2MaximumSpanningForest(graph)); in TEST()
169 Graph<int> graph; in TEST() local
170 graph.AddVertex(0); in TEST()
171 graph.AddVertex(1); in TEST()
172 graph.AddVertex(2); in TEST()
173 graph.AddVertex(3); in TEST()
179 graph.AddEdge(0, 1, 1.0); in TEST()
180 graph.AddEdge(2, 3, 1.0); in TEST()
181 VertexTotalOrdering<int> less_than(graph); in TEST()
201 Graph<int> graph; in TEST() local
202 graph.AddVertex(0); in TEST()
203 graph.AddVertex(1); in TEST()
204 graph.AddVertex(2); in TEST()
205 graph.AddVertex(3); in TEST()
207 graph.AddEdge(0, 1); in TEST()
208 graph.AddEdge(0, 2); in TEST()
209 graph.AddEdge(0, 3); in TEST()
210 graph.AddEdge(1, 2); in TEST()
211 graph.AddEdge(1, 3); in TEST()
212 graph.AddEdge(2, 3); in TEST()
225 StableIndependentSetOrdering(graph, &ordering); in TEST()
237 StableIndependentSetOrdering(graph, &ordering); in TEST()