io.konig.core.util.ClassHierarchyPaths Maven / Gradle / Ivy

Go to download

Show more of this group Show more artifacts with this name
Show all versions of konig-core Show documentation

A library for core classes (Graph, Vertex, Edge, etc.)

There is a newer version: 2.11.0

package io.konig.core.util;

/*
 * #%L
 * Konig Core
 * %%
 * Copyright (C) 2015 - 2017 Gregory McFall
 * %%
 * 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.
 * #L%
 */


import java.util.ArrayList;
import java.util.Collections;
import java.util.Comparator;
import java.util.List;
import java.util.Set;

import org.openrdf.model.URI;
import org.openrdf.model.vocabulary.OWL;
import org.openrdf.model.vocabulary.RDFS;

import io.konig.core.KonigException;
import io.konig.core.Vertex;
import io.konig.core.vocab.Schema;

/**
 * A list of paths starting at some target OWL class and traversing all ancestors
 * in the subsumption hierarchy, up to but excluding owl:Thing and schema:Thing.
 * 
 * @author Greg McFall
 *
 */
public class ClassHierarchyPaths extends ArrayList> {
	private static final long serialVersionUID = 1L;
	
	public ClassHierarchyPaths(Vertex targetClass) {
		build(targetClass);
	}

	private void build(Vertex targetClass) {
		if (targetClass.getId() instanceof URI) {

			List list = new ArrayList<>();

			URI classId = (URI) targetClass.getId();
			list.add(classId);
			add(list);
			
			addSuperClasses(list, targetClass);
		}
		Collections.sort(this, new Comparator>() {

			@Override
			public int compare(List aList, List bList) {
				if (aList == bList) {
					return 0;
				}
				int min = Math.min(aList.size(), bList.size());
				for (int i=0; i list, Vertex targetClass) {
		
		Set superSet = targetClass.asTraversal().out(RDFS.SUBCLASSOF).toUriSet();
		superSet.remove(OWL.THING);
		superSet.remove(Schema.Thing);
		
		if (!superSet.isEmpty()) {
			
			boolean multiple = superSet.size()>1;
			if (multiple) {
				remove(list);
			}
			for (URI superId : superSet) {
				List sink = multiple ? new ArrayList<>(list) : list;
				sink.add(superId);
				if (multiple) {
					add(sink);
				}
				Vertex superVertex = targetClass.getGraph().getVertex(superId);
				if (superVertex == null) {
					throw new KonigException("Vertex not found: " + superId.stringValue());
				}
				addSuperClasses(sink, superVertex);
			}
		}
	}

}