public Object createGraph(GraphmlContext context, String id, String edgedefault) { Digraph digraph = new MapDigraph(MapDigraph.TREEMAP_FACTORY); context.setGraph(digraph); return digraph; }
public void generate() { schemaGraph = new MapDigraph(MapDigraph.HASHMAP_FACTORY); generateAcyclicSchema(); }
private void init() { List dbEntitiesToResolve = collectAllDbEntities(); Digraph pkDependencyGraph = new MapDigraph(MapDigraph.HASHMAP_FACTORY); indexedDbEntities = new HashMap(dbEntitiesToResolve.size()); for (Iterator i = dbEntitiesToResolve.iterator(); i.hasNext();) { pkDependencyGraph, CollectionFactory.ARRAYLIST_FACTORY); Digraph contractedDigraph = new MapDigraph(MapDigraph.HASHMAP_FACTORY); contractor.contract(contractedDigraph, CollectionFactory.ARRAYLIST_FACTORY); IndegreeTopologicalSort sorter = new IndegreeTopologicalSort(
private static Digraph createDigraph4() { Digraph digraph = new MapDigraph(MapDigraph.HASHMAP_FACTORY); String[] vertices = new String[] { "A", "B", "C", "D", "E" }; digraph.addAllVertices(Arrays.asList(vertices)); digraph.putArc("A", "B", Boolean.TRUE); digraph.putArc("A", "C", Boolean.TRUE); digraph.putArc("B", "D", Boolean.TRUE); digraph.putArc("C", "E", Boolean.TRUE); return digraph; } }
private void init() { List dbEntitiesToResolve = collectAllDbEntities(); Digraph pkDependencyGraph = new MapDigraph(MapDigraph.HASHMAP_FACTORY); indexedDbEntities = new HashMap(dbEntitiesToResolve.size()); for (Iterator i = dbEntitiesToResolve.iterator(); i.hasNext();) { pkDependencyGraph, CollectionFactory.ARRAYLIST_FACTORY); Digraph contractedDigraph = new MapDigraph(MapDigraph.HASHMAP_FACTORY); contractor.contract(contractedDigraph, CollectionFactory.ARRAYLIST_FACTORY); IndegreeTopologicalSort sorter = new IndegreeTopologicalSort(
referentialDigraph = new MapDigraph(MapDigraph.HASHMAP_FACTORY); DbUtils.buildReferentialDigraph(referentialDigraph, tables); StrongConnection contractor = new StrongConnection( referentialDigraph, CollectionFactory.ARRAYLIST_FACTORY); contractedReferentialDigraph = new MapDigraph(MapDigraph.HASHMAP_FACTORY); contractor.contract( contractedReferentialDigraph,
referentialDigraph = new MapDigraph(MapDigraph.HASHMAP_FACTORY); DbUtils.buildReferentialDigraph(referentialDigraph, tables); StrongConnection contractor = new StrongConnection( referentialDigraph, CollectionFactory.ARRAYLIST_FACTORY); contractedReferentialDigraph = new MapDigraph(MapDigraph.HASHMAP_FACTORY); contractor.contract( contractedReferentialDigraph,
private void createWrapperDigraph() { wrapperDigraph = new MapDigraph(MapDigraph.HASHMAP_FACTORY); vertexWrapperMap = new HashMap(digraph.order()); for (Iterator i = digraph.vertexIterator(); i.hasNext();) { Object vertex = i.next(); VertexWrapper wrapper = new VertexWrapper(vertex); vertexWrapperMap.put(vertex, wrapper); wrapperDigraph.addVertex(wrapper); } for (ArcIterator i = digraph.arcIterator(); i.hasNext();) { i.next(); Object wrapper1 = vertexWrapperMap.get(i.getOrigin()); Object wrapper2 = vertexWrapperMap.get(i.getDestination()); if (rootsUpwards) wrapperDigraph.putArc(wrapper1, wrapper2, Boolean.TRUE); else wrapperDigraph.putArc(wrapper2, wrapper1, Boolean.TRUE); } }
private void generateAcyclicSchema() { Digraph graph = new MapDigraph(MapDigraph.HASHMAP_FACTORY); Map vertexToTable = new HashMap(); GraphUtils.randomizeAcyclic(graph, tableCount, maxForeignKeysPerTable,
private static Digraph createDigraph2() { Digraph digraph = new MapDigraph(MapDigraph.HASHMAP_FACTORY); String[] vertices = new String[] { "A", "B", "C", "D", "E", "F" }; digraph.addAllVertices(Arrays.asList(vertices)); digraph.putArc("A", "B", Boolean.TRUE); digraph.putArc("A", "F", Boolean.TRUE); digraph.putArc("B", "C", Boolean.TRUE); digraph.putArc("F", "D", Boolean.TRUE); digraph.putArc("C", "D", Boolean.TRUE); digraph.putArc("E", "D", Boolean.TRUE); return digraph; }
private static Digraph createDigraph3() { Digraph digraph = new MapDigraph(MapDigraph.HASHMAP_FACTORY); String[] vertices = new String[] { "A", "B", "C", "D", "E", "F" }; digraph.addAllVertices(Arrays.asList(vertices)); digraph.putArc("A", "B", Boolean.TRUE); digraph.putArc("A", "E", Boolean.TRUE); digraph.putArc("B", "F", Boolean.TRUE); digraph.putArc("C", "E", Boolean.TRUE); digraph.putArc("C", "D", Boolean.TRUE); digraph.putArc("E", "D", Boolean.TRUE); digraph.putArc("E", "B", Boolean.TRUE); digraph.putArc("D", "F", Boolean.TRUE); return digraph; }
Digraph objectDependencyGraph = new MapDigraph(MapDigraph.HASHMAP_FACTORY); Object[] masters = new Object[reflexiveRelNames.length]; for (int i = 0; i < size; i++) {
Digraph objectDependencyGraph = new MapDigraph(MapDigraph.HASHMAP_FACTORY); Object[] masters = new Object[reflexiveRelNames.length]; for (int i = 0; i < size; i++) {
public void untwineSubgraphs(Layer[] layers) { root.computePosition(); Digraph subgraphOrderingGraph = new MapDigraph(); for (int i = 0; i < layers.length; i++) { for (int j = 0; j < layers[i].size() - 1; j++) {
public static void main(String[] args) { Digraph digraph = new MapDigraph(MapDigraph.HASHMAP_FACTORY); Random randomizer = new Random(100); GraphUtils.randomizeTree(digraph, 3, 4, randomizer);
private static Digraph createDigraph1() { Digraph digraph = new MapDigraph(MapDigraph.HASHMAP_FACTORY); String[] vertices = new String[] { "A", "B", "C", "D", "E", "F", "G", "H", "J" }; digraph.addAllVertices(Arrays.asList(vertices)); digraph.putArc("D", "A", Boolean.TRUE); digraph.putArc("D", "B", Boolean.TRUE); digraph.putArc("F", "B", Boolean.TRUE); digraph.putArc("G", "C", Boolean.TRUE); digraph.putArc("E", "D", Boolean.TRUE); digraph.putArc("H", "F", Boolean.TRUE); digraph.putArc("F", "G", Boolean.TRUE); digraph.putArc("E", "H", Boolean.TRUE); digraph.putArc("J", "E", Boolean.TRUE); digraph.putArc("J", "H", Boolean.TRUE); digraph.putArc("J", "G", Boolean.TRUE); return digraph; }
public Digraph positionArcs() { Digraph arcGeometryDigraph = new MapDigraph(); for (ArcIterator i = longArcDigraph.arcIterator(); i.hasNext(); ) { LayerVertex dummy = (LayerVertex)i.next();
longArcDigraph = new MapDigraph(); for (Iterator i = digraph.vertexIterator(); i.hasNext(); ) { Object vertex = i.next();