de.viadee.bpm.vPAV.processing.model.graph.IGraph Maven / Gradle / Ivy
/**
* BSD 3-Clause License
*
* Copyright © 2018, viadee Unternehmensberatung GmbH
* All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions are met:
*
* * Redistributions of source code must retain the above copyright notice, this
* list of conditions and the following disclaimer.
*
* * Redistributions in binary form must reproduce the above copyright notice,
* this list of conditions and the following disclaimer in the documentation
* and/or other materials provided with the distribution.
*
* * Neither the name of the copyright holder nor the names of its
* contributors may be used to endorse or promote products derived from
* this software without specific prior written permission.
*
* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
* AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
* DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR
* SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER
* CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,
* OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
* OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
*/
package de.viadee.bpm.vPAV.processing.model.graph;
import java.util.Collection;
/**
* University of Washington, Computer Science & Engineering, Course 373, Winter 2011, Jessica Miller
*
* A basic graph interface.
*/
import java.util.List;
import java.util.Map;
import de.viadee.bpm.vPAV.processing.model.data.AnomalyContainer;
import de.viadee.bpm.vPAV.processing.model.data.BpmnElement;
public interface IGraph {
public String getProcessId();
public void addVertex(BpmnElement v);
public Collection getVertices();
public void addEdge(BpmnElement v1, BpmnElement v2, int weight);
public Collection> getEdges();
public void removeEdge(BpmnElement v1, BpmnElement v2);
public boolean hasEdge(BpmnElement v1, BpmnElement v2);
public Edge getEdge(BpmnElement v1, BpmnElement v2);
public List getAllInvalidPaths(BpmnElement v, AnomalyContainer anomaly);
public void setAnomalyInformation(BpmnElement v);
public Map> getNodesWithAnomalies();
public void addStartNode(final BpmnElement node);
public Collection getStartNodes();
public void addEndNode(final BpmnElement node);
public Collection getEndNodes();
public String toString();
}
© 2015 - 2025 Weber Informatics LLC | Privacy Policy