/*
* Copyright 2016 Red Hat, Inc. and/or its affiliates.
*
* Licensed under the Apache License, Version 2.0 (the "License");
* you may not use this file except in compliance with the License.
* You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agreed to in writing, software
* distributed under the License is distributed on an "AS IS" BASIS,
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
* See the License for the specific language governing permissions and
* limitations under the License.
*/
package org.kie.workbench.common.stunner.core.graph.processing.traverse.content;
import org.kie.workbench.common.stunner.core.graph.Edge;
import org.kie.workbench.common.stunner.core.graph.Graph;
import org.kie.workbench.common.stunner.core.graph.Node;
import org.kie.workbench.common.stunner.core.graph.content.definition.DefinitionSet;
import org.kie.workbench.common.stunner.core.graph.content.view.View;
public abstract class AbstractFullContentTraverseCallback<N extends Node<View, Edge>, E extends Edge<Object, Node>>
implements FullContentTraverseCallback<N, E> {
@Override
public void startViewEdgeTraversal(final E edge) {
}
@Override
public void endViewEdgeTraversal(final E edge) {
}
@Override
public void startChildEdgeTraversal(final E edge) {
}
@Override
public void endChildEdgeTraversal(final E edge) {
}
@Override
public void startParentEdgeTraversal(final E edge) {
}
@Override
public void endParentEdgeTraversal(final E edge) {
}
@Override
public void startGraphTraversal(final Graph<DefinitionSet, N> graph) {
}
@Override
public void startEdgeTraversal(final E edge) {
}
@Override
public void endEdgeTraversal(final E edge) {
}
@Override
public void startNodeTraversal(final N node) {
}
@Override
public void endNodeTraversal(final N node) {
}
@Override
public void endGraphTraversal() {
}
}