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

kieker.analysis.generic.graph.traversal.DeepGraphTraverser Maven / Gradle / Ivy

There is a newer version: 2.0.2
Show newest version
/***************************************************************************
 * Copyright 2022 Kieker Project (http://kieker-monitoring.net)
 *
 * 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 kieker.analysis.generic.graph.traversal;

import java.util.List;

import com.google.common.graph.MutableNetwork;

import kieker.analysis.generic.graph.IEdge;
import kieker.analysis.generic.graph.INode;

/**
 * @param 
 *            node type
 * @param 
 *            edge type
 *
 * @author Sören Henning
 *
 * @since 1.14
 */
public class DeepGraphTraverser extends AbstractGraphTraverser {

	public DeepGraphTraverser() {
		super();
	}

	public DeepGraphTraverser(final List> nodeVisitors, final List> edgeVisitors) {
		super(nodeVisitors, edgeVisitors);
	}

	public DeepGraphTraverser(final INodeVisitor nodeVisitor, final IEdgeVisitor edgeVisitor) {
		super(nodeVisitor, edgeVisitor);
	}

	@SuppressWarnings("unchecked")
	@Override
	public void traverse(final MutableNetwork graph) {
		for (final N node : graph.nodes()) {
			for (final INodeVisitor visitor : this.nodeVisitors) {
				visitor.visitNode(node);
			}
			if (node.getChildGraph() != null) {
				this.traverse((MutableNetwork) node.getChildGraph().getGraph());
			}
		}

		for (final E edge : graph.edges()) {
			for (final IEdgeVisitor visitor : this.edgeVisitors) {
				visitor.visitEdge(edge);
			}
		}
	}

}




© 2015 - 2024 Weber Informatics LLC | Privacy Policy