cc.kave.repackaged.jayes.util.Graph Maven / Gradle / Ivy

Go to download

Show more of this group Show more artifacts with this name
Show all versions of cc.kave.repackaged.jayes Show documentation

Repackaging of Jayes (Eclipse Code Recommenders) to make it available in Maven.

The newest version!

/**
 * Copyright (c) 2011 Michael Kutschke.
 * All rights reserved. This program and the accompanying materials
 * are made available under the terms of the Eclipse Public License v1.0
 * which accompanies this distribution, and is available at
 * http://www.eclipse.org/legal/epl-v10.html
 *
 * Contributors:
 *    Michael Kutschke - initial API and implementation.
 */
package cc.kave.repackaged.jayes.util;

import java.util.ArrayList;
import java.util.HashSet;
import java.util.List;
import java.util.Set;

public class Graph implements Cloneable {

    // we need to remove edges a lot, thats why we use Set here instead of List
    private List> adjacency = new ArrayList>();

    public List> getAdjacency() {
        return adjacency;
    }

    public void initialize(final int nodes) {
        adjacency.clear();
        for (int i = 0; i < nodes; i++) {
            adjacency.add(new HashSet());
        }
    }

    public Edge addEdge(final int v1, final int v2) {
        for (int i = 0; i < (Math.max(v1, v2) - adjacency.size()); i++) {
            adjacency.add(new HashSet());
        }
        final Edge e = new Edge(v1, v2);
        adjacency.get(v1).add(e);
        adjacency.get(v2).add(e.initializeBackEdge());
        return e;
    }

    public void removeEdge(final Edge e) {
        adjacency.get(e.getFirst()).remove(e);
        adjacency.get(e.getSecond()).remove(e.getBackEdge());
    }

    public Set getIncidentEdges(final int v) {
        return adjacency.get(v);
    }

    public static class Edge extends OrderIgnoringPair {

        private Edge backEdge;

        public Edge(final Integer o1, final Integer o2) {
            super(o1, o2);
        }

        public Edge initializeBackEdge() {
            backEdge = new Edge(getSecond(), getFirst());
            backEdge.backEdge = this;
            return getBackEdge();
        }

        public Edge getBackEdge() {
            return backEdge;
        }

    }

    @Override
    public Graph clone() {
        try {
            Graph clone = (Graph) super.clone();
            clone.adjacency = new ArrayList>();
            for (Set edges : adjacency) {
                clone.adjacency.add(new HashSet(edges));
            }
            return clone;
        } catch (CloneNotSupportedException e) {
            // should not happen
            throw new RuntimeException(e);
        }

    }

}