本文整理汇总了Java中com.google.javascript.jscomp.graph.Graph类的典型用法代码示例。如果您正苦于以下问题:Java Graph类的具体用法?Java Graph怎么用?Java Graph使用的例子?那么恭喜您, 这里精选的类代码示例或许可以为您提供帮助。
Graph类属于com.google.javascript.jscomp.graph包,在下文中一共展示了Graph类的17个代码示例,这些例子默认根据受欢迎程度排序。您可以为喜欢或者感觉有用的代码点赞,您的评价将有助于我们的系统推荐出更棒的Java代码示例。
示例1: testGreedy
import com.google.javascript.jscomp.graph.Graph; //导入依赖的package包/类
public void testGreedy() {
Graph<String, String> graph = new LinkedUndirectedGraph<String, String>();
graph.createNode("A");
graph.createNode("B");
graph.createNode("C");
graph.createNode("D");
graph.connect("A", "--", "C");
graph.connect("B", "--", "C");
graph.connect("B", "--", "D");
GraphColoring<String, String> coloring =
new GreedyGraphColoring<String, String>(graph);
assertEquals(2, coloring.color());
validateColoring(graph);
assertEquals("A", coloring.getPartitionSuperNode("A"));
assertEquals("A", coloring.getPartitionSuperNode("B"));
assertEquals("C", coloring.getPartitionSuperNode("C"));
}
开发者ID:andyjko,项目名称:feedlack,代码行数:18,代码来源:GraphColoringTest.java
示例2: testFullyConnected
import com.google.javascript.jscomp.graph.Graph; //导入依赖的package包/类
public void testFullyConnected() {
final int count = 100;
Graph<String, String> graph = new LinkedUndirectedGraph<String, String>();
for (int i = 0; i < count; i++) {
graph.createNode("Node " + i);
for (int j = 0; j < count; j++) {
graph.createNode("Node " + j);
if (i != j) {
graph.connect("Node " + i, null, "Node " + j);
}
}
}
GraphColoring<String, String> coloring =
new GreedyGraphColoring<String, String>(graph);
assertEquals(count, coloring.color());
validateColoring(graph);
for (int i = 0; i < count; i++) {
assertEquals("Node " + i, coloring.getPartitionSuperNode("Node " + i));
}
}
开发者ID:andyjko,项目名称:feedlack,代码行数:21,代码来源:GraphColoringTest.java
示例3: testAllConnectedToOneNode
import com.google.javascript.jscomp.graph.Graph; //导入依赖的package包/类
public void testAllConnectedToOneNode() {
final int count = 10;
Graph<String, String> graph = new LinkedUndirectedGraph<String, String>();
graph.createNode("Center");
for (int i = 0; i < count; i++) {
graph.createNode("Node " + i);
graph.connect("Center", null, "Node " + i);
}
GraphColoring<String, String> coloring =
new GreedyGraphColoring<String, String>(graph);
assertEquals(2, coloring.color());
validateColoring(graph);
assertEquals("Center", coloring.getPartitionSuperNode("Center"));
for (int i = 0; i < count; i++) {
assertEquals("Node 0", coloring.getPartitionSuperNode("Node " + i));
}
}
开发者ID:andyjko,项目名称:feedlack,代码行数:18,代码来源:GraphColoringTest.java
示例4: testGreedy
import com.google.javascript.jscomp.graph.Graph; //导入依赖的package包/类
public void testGreedy() {
Graph<String, String> graph = LinkedUndirectedGraph.create();
graph.createNode("A");
graph.createNode("B");
graph.createNode("C");
graph.createNode("D");
graph.connect("A", "--", "C");
graph.connect("B", "--", "C");
graph.connect("B", "--", "D");
GraphColoring<String, String> coloring =
new GreedyGraphColoring<String, String>(graph);
assertEquals(2, coloring.color());
validateColoring(graph);
assertEquals("A", coloring.getPartitionSuperNode("A"));
assertEquals("A", coloring.getPartitionSuperNode("B"));
assertEquals("C", coloring.getPartitionSuperNode("C"));
}
开发者ID:SpoonLabs,项目名称:astor,代码行数:18,代码来源:GraphColoringTest.java
示例5: testFullyConnected
import com.google.javascript.jscomp.graph.Graph; //导入依赖的package包/类
public void testFullyConnected() {
final int count = 100;
Graph<String, String> graph = LinkedUndirectedGraph.create();
for (int i = 0; i < count; i++) {
graph.createNode("Node " + i);
for (int j = 0; j < count; j++) {
graph.createNode("Node " + j);
if (i != j) {
graph.connect("Node " + i, null, "Node " + j);
}
}
}
GraphColoring<String, String> coloring =
new GreedyGraphColoring<String, String>(graph);
assertEquals(count, coloring.color());
validateColoring(graph);
for (int i = 0; i < count; i++) {
assertEquals("Node " + i, coloring.getPartitionSuperNode("Node " + i));
}
}
开发者ID:SpoonLabs,项目名称:astor,代码行数:21,代码来源:GraphColoringTest.java
示例6: testAllConnectedToOneNode
import com.google.javascript.jscomp.graph.Graph; //导入依赖的package包/类
public void testAllConnectedToOneNode() {
final int count = 10;
Graph<String, String> graph = LinkedUndirectedGraph.create();
graph.createNode("Center");
for (int i = 0; i < count; i++) {
graph.createNode("Node " + i);
graph.connect("Center", null, "Node " + i);
}
GraphColoring<String, String> coloring =
new GreedyGraphColoring<String, String>(graph);
assertEquals(2, coloring.color());
validateColoring(graph);
assertEquals("Center", coloring.getPartitionSuperNode("Center"));
for (int i = 0; i < count; i++) {
assertEquals("Node 0", coloring.getPartitionSuperNode("Node " + i));
}
}
开发者ID:SpoonLabs,项目名称:astor,代码行数:18,代码来源:GraphColoringTest.java
示例7: testNoEdge
import com.google.javascript.jscomp.graph.Graph; //导入依赖的package包/类
public void testNoEdge() {
Graph<String, String> graph = new LinkedUndirectedGraph<String, String>();
for (int i = 0; i < 5; i++) {
graph.createNode("Node " + i);
// All node with same color.
GraphColoring<String, String> coloring =
new GreedyGraphColoring<String, String>(graph);
assertEquals(1, coloring.color());
validateColoring(graph);
for (int j = 0; j < i; j++) {
assertEquals("Node 0", coloring.getPartitionSuperNode("Node 0"));
}
}
}
开发者ID:andyjko,项目名称:feedlack,代码行数:15,代码来源:GraphColoringTest.java
示例8: testTwoNodesConnected
import com.google.javascript.jscomp.graph.Graph; //导入依赖的package包/类
public void testTwoNodesConnected() {
Graph<String, String> graph = new LinkedUndirectedGraph<String, String>();
graph.createNode("A");
graph.createNode("B");
graph.connect("A", "--", "B");
GraphColoring<String, String> coloring =
new GreedyGraphColoring<String, String>(graph);
assertEquals(2, coloring.color());
validateColoring(graph);
assertEquals("A", coloring.getPartitionSuperNode("A"));
assertEquals("B", coloring.getPartitionSuperNode("B"));
}
开发者ID:andyjko,项目名称:feedlack,代码行数:13,代码来源:GraphColoringTest.java
示例9: testTwoFullyConnected
import com.google.javascript.jscomp.graph.Graph; //导入依赖的package包/类
public void testTwoFullyConnected() {
final int count = 100;
// A graph with two disconnected disjunct cliques.
Graph<String, String> graph = new LinkedUndirectedGraph<String, String>();
for (int i = 0; i < count; i++) {
graph.createNode("Node Left " + i);
graph.createNode("Node Right " + i);
for (int j = 0; j < count; j++) {
graph.createNode("Node Left " + j);
graph.createNode("Node Right " + j);
if (i != j) {
graph.connect("Node Left " + i, null, "Node Left " + j);
graph.connect("Node Right " + i, null, "Node Right " + j);
}
}
}
assertEquals(count, new GreedyGraphColoring<String, String>(graph).color());
validateColoring(graph);
// Connect the two cliques.
for (int i = 0; i < count; i++) {
graph.connect("Node Left " + i, null, "Node Right " + i);
}
// Think of two exactly same graph with the same coloring side by side.
// If we circularly shift the colors of one of the graph by 1, we can
// connect the isomorphic nodes and still have a valid coloring in the
// resulting graph.
assertEquals(count, new GreedyGraphColoring<String, String>(graph).color());
validateColoring(graph);
}
开发者ID:andyjko,项目名称:feedlack,代码行数:31,代码来源:GraphColoringTest.java
示例10: validateColoring
import com.google.javascript.jscomp.graph.Graph; //导入依赖的package包/类
/**
* Validate that each node has been colored and connected nodes have different
* coloring.
*/
private static <N, E> void validateColoring(Graph<N, E> graph) {
for (GraphNode<N, E> node : graph.getNodes()) {
assertTrue(node.getAnnotation() != null);
}
for (GraphEdge<N, E> edge : graph.getEdges()) {
Color c1 = edge.getNodeA().getAnnotation();
Color c2 = edge.getNodeB().getAnnotation();
assertTrue(c1 != null);
assertTrue(c2 != null);
assertTrue(!c1.equals(c2));
}
}
开发者ID:andyjko,项目名称:feedlack,代码行数:17,代码来源:GraphColoringTest.java
示例11: testEdgeAnnotations
import com.google.javascript.jscomp.graph.Graph; //导入依赖的package包/类
public void testEdgeAnnotations() {
Graph<String, String> graph = new LinkedUndirectedGraph<String, String>();
graph.createNode("1");
graph.createNode("2");
graph.createNode("3");
graph.connect("1", "a", "2");
graph.connect("2", "b", "3");
GraphEdge<String, String> a = graph.getEdges("1", "2").get(0);
GraphEdge<String, String> b = graph.getEdges("2", "3").get(0);
checkAnnotations(graph, a, b);
}
开发者ID:andyjko,项目名称:feedlack,代码行数:12,代码来源:GraphTest.java
示例12: testDirectedDegree
import com.google.javascript.jscomp.graph.Graph; //导入依赖的package包/类
public void testDirectedDegree(Graph<String, String> graph) {
graph.createNode("a");
graph.createNode("b");
graph.createNode("c");
graph.createNode("d");
assertEquals(0, graph.getNodeDegree("a"));
graph.connect("a", "-", "b");
assertEquals(1, graph.getNodeDegree("a"));
graph.connect("b", "-", "c");
assertEquals(1, graph.getNodeDegree("a"));
graph.connect("a", "-", "c");
assertEquals(2, graph.getNodeDegree("a"));
graph.connect("d", "-", "a");
assertEquals(3, graph.getNodeDegree("a"));
}
开发者ID:andyjko,项目名称:feedlack,代码行数:16,代码来源:GraphTest.java
示例13: testDirectedConnectIfNotFound
import com.google.javascript.jscomp.graph.Graph; //导入依赖的package包/类
public void testDirectedConnectIfNotFound(Graph<String, String> graph) {
graph.createNode("a");
graph.createNode("b");
graph.connectIfNotFound("a", "-", "b");
assertEquals(1, graph.getNodeDegree("a"));
graph.connectIfNotFound("a", "-", "b");
assertEquals(1, graph.getNodeDegree("a"));
graph.connectIfNotFound("a", null, "b");
assertEquals(2, graph.getNodeDegree("a"));
graph.connectIfNotFound("a", null, "b");
assertEquals(2, graph.getNodeDegree("a"));
}
开发者ID:andyjko,项目名称:feedlack,代码行数:13,代码来源:GraphTest.java
示例14: testNoEdge
import com.google.javascript.jscomp.graph.Graph; //导入依赖的package包/类
public void testNoEdge() {
Graph<String, String> graph = LinkedUndirectedGraph.create();
for (int i = 0; i < 5; i++) {
graph.createNode("Node " + i);
// All node with same color.
GraphColoring<String, String> coloring =
new GreedyGraphColoring<String, String>(graph);
assertEquals(1, coloring.color());
validateColoring(graph);
for (int j = 0; j < i; j++) {
assertEquals("Node 0", coloring.getPartitionSuperNode("Node 0"));
}
}
}
开发者ID:SpoonLabs,项目名称:astor,代码行数:15,代码来源:GraphColoringTest.java
示例15: testTwoNodesConnected
import com.google.javascript.jscomp.graph.Graph; //导入依赖的package包/类
public void testTwoNodesConnected() {
Graph<String, String> graph = LinkedUndirectedGraph.create();
graph.createNode("A");
graph.createNode("B");
graph.connect("A", "--", "B");
GraphColoring<String, String> coloring =
new GreedyGraphColoring<String, String>(graph);
assertEquals(2, coloring.color());
validateColoring(graph);
assertEquals("A", coloring.getPartitionSuperNode("A"));
assertEquals("B", coloring.getPartitionSuperNode("B"));
}
开发者ID:SpoonLabs,项目名称:astor,代码行数:13,代码来源:GraphColoringTest.java
示例16: testTwoFullyConnected
import com.google.javascript.jscomp.graph.Graph; //导入依赖的package包/类
public void testTwoFullyConnected() {
final int count = 100;
// A graph with two disconnected disjunct cliques.
Graph<String, String> graph = LinkedUndirectedGraph.create();
for (int i = 0; i < count; i++) {
graph.createNode("Node Left " + i);
graph.createNode("Node Right " + i);
for (int j = 0; j < count; j++) {
graph.createNode("Node Left " + j);
graph.createNode("Node Right " + j);
if (i != j) {
graph.connect("Node Left " + i, null, "Node Left " + j);
graph.connect("Node Right " + i, null, "Node Right " + j);
}
}
}
assertEquals(count, new GreedyGraphColoring<String, String>(graph).color());
validateColoring(graph);
// Connect the two cliques.
for (int i = 0; i < count; i++) {
graph.connect("Node Left " + i, null, "Node Right " + i);
}
// Think of two exactly same graph with the same coloring side by side.
// If we circularly shift the colors of one of the graph by 1, we can
// connect the isomorphic nodes and still have a valid coloring in the
// resulting graph.
assertEquals(count, new GreedyGraphColoring<String, String>(graph).color());
validateColoring(graph);
}
开发者ID:SpoonLabs,项目名称:astor,代码行数:31,代码来源:GraphColoringTest.java
示例17: testEdgeAnnotations
import com.google.javascript.jscomp.graph.Graph; //导入依赖的package包/类
public void testEdgeAnnotations() {
Graph<String, String> graph = LinkedUndirectedGraph.create();
graph.createNode("1");
graph.createNode("2");
graph.createNode("3");
graph.connect("1", "a", "2");
graph.connect("2", "b", "3");
GraphEdge<String, String> a = graph.getEdges("1", "2").get(0);
GraphEdge<String, String> b = graph.getEdges("2", "3").get(0);
checkAnnotations(graph, a, b);
}
开发者ID:SpoonLabs,项目名称:astor,代码行数:12,代码来源:GraphTest.java
注:本文中的com.google.javascript.jscomp.graph.Graph类示例整理自Github/MSDocs等源码及文档管理平台,相关代码片段筛选自各路编程大神贡献的开源项目,源码版权归原作者所有,传播和使用请参考对应项目的License;未经允许,请勿转载。 |
请发表评论