All Downloads are FREE. Search and download functionalities are using the official Maven repository.

com.redhat.lightblue.assoc.ConnMx Maven / Gradle / Ivy

There is a newer version: 2.18.0
Show newest version
/*
 Copyright 2013 Red Hat, Inc. and/or its affiliates.

 This file is part of lightblue.

 This program is free software: you can redistribute it and/or modify
 it under the terms of the GNU General Public License as published by
 the Free Software Foundation, either version 3 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 Public License for more details.

 You should have received a copy of the GNU General Public License
 along with this program.  If not, see .
 */
package com.redhat.lightblue.assoc;

import java.io.Serializable;

/**
 * A simple connection matrix implementation
 */
public class ConnMx implements Serializable {
    
    private static final long serialVersionUID=1l;

    private static final int[] I0=new int[0];
    
    /**
     * Connection matrix. connMx[i][j] is true if there is an edge from i to j
     */
    private final boolean[][] connMx;

    public ConnMx(int nNodes) {
        connMx=new boolean[nNodes][];
        for(int i=0;ifrom to to
     */
    public boolean isDirectedConnected(int from,
                                       int to) {
        return connMx[from][to];
    }

    /**
     * Returns if there exists an edge between the two nodes, pointing either way
     */
    public boolean isUndirectedConnected(int from,
                                         int to) {
        return connMx[from][to]||connMx[to][from];
    }


    @Override
    public String toString() {
        StringBuilder bld=new StringBuilder(128);
        for(int i=0;ifrom to node to
     */
    public void connect(int from,int to) {
        connMx[from][to]=true;
    }

    private int[] trunc(int[] arr,int n) {
        if(n==arr.length)
            return arr;
        else if(n==0)
            return I0;
        else {
            int[] ret=new int[n];
            System.arraycopy(arr,0,ret,0,n);
            return ret;
        }
    }
    
}




© 2015 - 2025 Weber Informatics LLC | Privacy Policy