qilin.util.graph.ConcurrentDirectedGraphImpl Maven / Gradle / Ivy

Go to download
/* Qilin - a Java Pointer Analysis Framework
 * Copyright (C) 2021-2030 Qilin developers
 *
 * This program is free software: you can redistribute it and/or modify
 * it under the terms of the GNU Lesser General Public License as
 * published by the Free Software Foundation, either version 3.0 of the
 * License, or (at your option) any later version.
 *
 * This program is distributed in the hope that it will be useful,
 * but WITHOUT ANY WARRANTY; without even the implied warranty of
 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
 * GNU General Lesser Public License for more details.
 *
 * You should have received a copy of the GNU General Lesser Public
 * License along with this program.  If not, see
 * .
 */

package qilin.util.graph;

import java.util.Collection;
import java.util.Collections;
import java.util.Map;
import java.util.Set;
import java.util.concurrent.ConcurrentHashMap;

public class ConcurrentDirectedGraphImpl implements DirectedGraph {
  protected Set nodes;
  protected Map> preds;
  protected Map> succs;

  public ConcurrentDirectedGraphImpl() {
    this.nodes = ConcurrentHashMap.newKeySet();
    this.preds = new ConcurrentHashMap<>();
    this.succs = new ConcurrentHashMap<>();
  }

  public void addNode(final N node) {
    this.nodes.add(node);
  }

  public void addEdge(final N from, final N to) {
    this.addNode(from);
    this.addNode(to);
    this.preds.computeIfAbsent(to, k -> ConcurrentHashMap.newKeySet()).add(from);
    this.succs.computeIfAbsent(from, k -> ConcurrentHashMap.newKeySet()).add(to);
  }

  @Override
  public Collection allNodes() {
    return this.nodes;
  }

  @Override
  public Collection predsOf(final N n) {
    return this.preds.getOrDefault(n, Collections.emptySet());
  }

  @Override
  public Collection succsOf(final N n) {
    return this.succs.getOrDefault(n, Collections.emptySet());
  }
}