X-Git-Url: https://gerrit.onap.org/r/gitweb?a=blobdiff_plain;f=datarouter-node%2Fsrc%2Fmain%2Fjava%2Fcom%2Fatt%2Fresearch%2Fdatarouter%2Fnode%2FPathFinder.java;fp=datarouter-node%2Fsrc%2Fmain%2Fjava%2Fcom%2Fatt%2Fresearch%2Fdatarouter%2Fnode%2FPathFinder.java;h=0000000000000000000000000000000000000000;hb=e4b20cc6f7c31f48ddd0de5bcd054b09a35cd510;hp=7ff918394bc3ad059882fb8ef6764cf1e2dca892;hpb=315f5603d8e42969a13d985ca8bb50146e82325a;p=dmaap%2Fdatarouter.git

diff --git a/datarouter-node/src/main/java/com/att/research/datarouter/node/PathFinder.java b/datarouter-node/src/main/java/com/att/research/datarouter/node/PathFinder.java
deleted file mode 100644
index 7ff91839..00000000
--- a/datarouter-node/src/main/java/com/att/research/datarouter/node/PathFinder.java
+++ /dev/null
@@ -1,132 +0,0 @@
-/*******************************************************************************
- * ============LICENSE_START==================================================
- * * org.onap.dmaap
- * * ===========================================================================
- * * Copyright © 2017 AT&T Intellectual Property. All rights reserved.
- * * ===========================================================================
- * * 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.
- * * ============LICENSE_END====================================================
- * *
- * * ECOMP is a trademark and service mark of AT&T Intellectual Property.
- * *
- ******************************************************************************/
-
-
-package com.att.research.datarouter.node;
-
-import java.util.*;
-
-/**
- *	Given a set of node names and next hops, identify and ignore any cycles and figure out the sequence of next hops to get from this node to any other node
- */
-
-public class PathFinder	{
-	private static class Hop	{
-		public boolean	mark;
-		public boolean	bad;
-		public NodeConfig.ProvHop	basis;
-	}
-	private Vector<String> errors = new Vector<String>();
-	private Hashtable<String, String> routes = new Hashtable<String, String>();
-	/**
-	 *	Get list of errors encountered while finding paths
-	 *	@return array of error descriptions
-	 */
-	public String[] getErrors() {
-		return(errors.toArray(new String[errors.size()]));
-	}
-	/**
-	 *	Get the route from this node to the specified node
-	 *	@param destination node
-	 *	@return	list of node names separated by and ending with "/"
-	 */
-	public String getPath(String destination) {
-		String ret = routes.get(destination);
-		if (ret == null) {
-			return("");
-		}
-		return(ret);
-	}
-	private String plot(String from, String to, Hashtable<String, Hop> info) {
-		Hop nh = info.get(from);
-		if (nh == null || nh.bad) {
-			return(to);
-		}
-		if (nh.mark) {
-			// loop detected;
-			while (!nh.bad) {
-				nh.bad = true;
-				errors.add(nh.basis + " is part of a cycle");
-				nh = info.get(nh.basis.getVia());
-			}
-			return(to);
-		}
-		nh.mark = true;
-		String x = plot(nh.basis.getVia(), to, info);
-		nh.mark = false;
-		if (nh.bad) {
-			return(to);
-		}
-		return(nh.basis.getVia() + "/" + x);
-	}
-	/**
-	 *	Find routes from a specified origin to all of the nodes given a set of specified next hops.
-	 *	@param origin	where we start
-	 *	@param nodes	where we can go
-	 *	@param hops	detours along the way
-	 */
-	public PathFinder(String origin, String[] nodes, NodeConfig.ProvHop[] hops) {
-		HashSet<String> known = new HashSet<String>();
-		Hashtable<String, Hashtable<String, Hop>> ht = new Hashtable<String, Hashtable<String, Hop>>();
-		for (String n: nodes) {
-			known.add(n);
-			ht.put(n, new Hashtable<String, Hop>());
-		}
-		for (NodeConfig.ProvHop ph: hops) {
-			if (!known.contains(ph.getFrom())) {
-				errors.add(ph + " references unknown from node");
-				continue;
-			}
-			if (!known.contains(ph.getTo())) {
-				errors.add(ph + " references unknown destination node");
-				continue;
-			}
-			Hashtable<String, Hop> ht2 = ht.get(ph.getTo());
-			Hop h = ht2.get(ph.getFrom());
-			if (h != null) {
-				h.bad = true;
-				errors.add(ph + " gives duplicate next hop - previous via was " + h.basis.getVia());
-				continue;
-			}
-			h = new Hop();
-			h.basis = ph;
-			ht2.put(ph.getFrom(), h);
-			if (!known.contains(ph.getVia())) {
-				errors.add(ph + " references unknown via node");
-				h.bad = true;
-				continue;
-			}
-			if (ph.getVia().equals(ph.getTo())) {
-				errors.add(ph + " gives destination as via");
-				h.bad = true;
-				continue;
-			}
-		}
-		for (String n: known) {
-			if (n.equals(origin)) {
-				routes.put(n, "");
-			}
-			routes.put(n, plot(origin, n, ht.get(n)) + "/");
-		}
-	}
-}