CategoryPartitionAddEdgeMultiGraphV2.java
package org.graphstream.graph.implementations;
import static org.junit.Assert.*;
import java.util.Random;
import org.databene.benerator.anno.Source;
import org.databene.feed4junit.Feeder;
import org.graphstream.graph.Edge;
import org.graphstream.graph.IdAlreadyInUseException;
import org.junit.Rule;
import org.junit.Test;
import org.junit.rules.ExpectedException;
import org.junit.runner.RunWith;
@RunWith(Feeder.class)
public class CategoryPartitionAddEdgeMultiGraphV2 {
// idExistance,idValue,graphNrNodes,graphStrictChecking,
// graphNrEdges,graphAutoCreate,sourceEx
@Rule
public ExpectedException exception = ExpectedException.none();
@Test(expected=IdAlreadyInUseException.class)
@Source("csvFiles/MultigraphAddEdge/CategoryPartitionAddEdge01.csv")
public void strtCheckAndAutoCreate(Boolean idExistance, String idValue, String nrNodes,
Boolean strictChecking, String nrEdges, Boolean autoCreate,
Boolean sourceEx) {
MultiGraph mg = new MultiGraph("Graph", strictChecking, autoCreate);
mg.addNode("node1");
mg.addEdge("E1", "node1", "node1");
}
@Test
@Source("csvFiles/MultigraphAddEdge/CategoryPartitionAddEdge02.csv")
public void testAddEdge(Boolean idExistance, String idValue, String nrNodes,
Boolean strictChecking, String nrEdges, Boolean autoCreate,
Boolean sourceEx, String outcome) {
MultiGraph ag = new MultiGraph("Graph", strictChecking, autoCreate);
ag.addEdge("E1", "node1", "node2");
assertEquals(1, ag.getEdgeCount());
}
}