/** * Delete attributes used by this algorithm in edges of the graph */ public void cleanEdges(){ cleanElement(graph.getEachEdge()); }
public void clear() { if (flagAttribute != null) for (Edge edge : graph.getEachEdge()) edge.removeAttribute(flagAttribute); }
/** * Reset flag attribute values. All edges are tagged as being out of the * tree. */ protected void resetFlags() { for (Edge edge : graph.getEachEdge()) edgeOff(edge); }
/** * Reset flag attribute values. All edges are tagged as being out of the * tree. */ protected void resetFlags() { for (Edge edge : graph.getEachEdge()) edgeOff(edge); }
public void clear() { if (flagAttribute != null) for (Edge edge : graph.getEachEdge()) edge.removeAttribute(flagAttribute); }
/** * Delete attributes used by this algorithm in edges of the graph */ public void cleanEdges(){ cleanElement(graph.getEachEdge()); }
/** * Set a default centrality of 0 to all edges. * * @param graph * The graph to modify. */ protected void initAllEdges(Graph graph) { if(doEdges) { for(Edge edge : graph.getEachEdge()) { setCentrality(edge, 0.0); } } }
/** * Set a default centrality of 0 to all edges. * * @param graph * The graph to modify. */ protected void initAllEdges(Graph graph) { if(doEdges) { for(Edge edge : graph.getEachEdge()) { setCentrality(edge, 0.0); } } }
private static String toString(Graph g) { StringBuilder buffer = new StringBuilder(); buffer.append("id=\"").append(g.getId()).append("\" node={"); for (Node n : g) buffer.append("\"").append(n.getId()).append("\", "); buffer.append("}, edges={"); for (Edge e : g.getEachEdge()) buffer.append("\"").append(e.getId()).append("\":\"") .append(e.getSourceNode().getId()).append("\"--\"") .append(e.getTargetNode().getId()).append("\", "); buffer.append("}"); return buffer.toString(); } }
private static String toString(Graph g) { StringBuilder buffer = new StringBuilder(); buffer.append("id=\"").append(g.getId()).append("\" node={"); for (Node n : g) buffer.append("\"").append(n.getId()).append("\", "); buffer.append("}, edges={"); for (Edge e : g.getEachEdge()) buffer.append("\"").append(e.getId()).append("\":\"") .append(e.getSourceNode().getId()).append("\"--\"") .append(e.getTargetNode().getId()).append("\", "); buffer.append("}"); return buffer.toString(); } }
protected void equipGraph() { for (Edge e : context.graph.getEachEdge()) { e.addAttribute(context.passesAttribute, 0.0); } for (Node n : context.graph) { n.addAttribute(context.passesAttribute, 0.0); } }
protected void equipGraph() { for (Edge e : context.graph.getEachEdge()) { e.addAttribute(context.passesAttribute, 0.0); } for (Node n : context.graph) { n.addAttribute(context.passesAttribute, 0.0); } }
SynchronizedGraph(Graph g) { super(g); elementLock = new ReentrantLock(); synchronizedNodes = new HashMap<String, Node>(); synchronizedEdges = new HashMap<String, Edge>(); for (Node n : g.getEachNode()) synchronizedNodes.put(n.getId(), new SynchronizedNode(this, n)); for (Edge e : g.getEachEdge()) synchronizedEdges.put(e.getId(), new SynchronizedEdge(this, e)); }
SynchronizedGraph(Graph g) { super(g); elementLock = new ReentrantLock(); synchronizedNodes = new HashMap<String, Node>(); synchronizedEdges = new HashMap<String, Edge>(); for (Node n : g.getEachNode()) synchronizedNodes.put(n.getId(), new SynchronizedNode(this, n)); for (Edge e : g.getEachEdge()) synchronizedEdges.put(e.getId(), new SynchronizedEdge(this, e)); }
/** * Delete attributes used by this algorithm in nodes and edges of the graph */ public void cleanGraph(){ cleanElement(graph.getEachEdge()); cleanElement(graph.getEachNode()); }
/** * Delete attributes used by this algorithm in nodes and edges of the graph */ public void cleanGraph(){ cleanElement(graph.getEachEdge()); cleanElement(graph.getEachNode()); }
/** * Apply evaporation on each edge. */ protected void evaporate() { for(Edge edge: context.graph.getEachEdge()) { edge.setAttribute(context.passesAttribute, edge.getNumber(context.passesAttribute)*evaporation); } for(Node node: context.graph) { node.setAttribute(context.passesAttribute, node.getNumber(context.passesAttribute)*evaporation); } }
/** * Apply evaporation on each edge. */ protected void evaporate() { for(Edge edge: context.graph.getEachEdge()) { edge.setAttribute(context.passesAttribute, edge.getNumber(context.passesAttribute)*evaporation); } for(Node node: context.graph) { node.setAttribute(context.passesAttribute, node.getNumber(context.passesAttribute)*evaporation); } }
public void markPath(String attribute, Object on, Object off) { for (Node n : env) n.setAttribute(attribute, off); for (Edge e : env.getEachEdge()) e.setAttribute(attribute, off); State s = position; do { s.node.setAttribute(attribute, on); s.node.getEdgeBetween(s.b.node).setAttribute(attribute, on); s = s.b; } while (s != g); g.node.setAttribute(attribute, on); }
public void markPath(String attribute, Object on, Object off) { for (Node n : env) n.setAttribute(attribute, off); for (Edge e : env.getEachEdge()) e.setAttribute(attribute, off); State s = position; do { s.node.setAttribute(attribute, on); s.node.getEdgeBetween(s.b.node).setAttribute(attribute, on); s = s.b; } while (s != g); g.node.setAttribute(attribute, on); }