/*
* Copyright (c) 2010 Mathew Hall, University of Sheffield.
* 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 University of Sheffield 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 primitives.cluster;
import primitives.graph.Transition;
import primitives.graph.Node;
import primitives.graph.Graph;
import java.io.IOException;
import search.util.TreeLoader;
import translator.DOTWriter;
public abstract class TreeUtils {
public static Graph stripReflexiveEdges(Graph g){
for(Node n: g.getTransitions().keySet()){
for(Transition t: g.getTransitions().get(n)){
if(t.getDestinationNode() == t.getSourceNode()){
n.deleteTransition(t);
}
}
}
return g;
}
public static Graph stripReflexiveEdges(String filename) throws IOException{
return new Graph(TreeLoader.loadTreeFromDot(filename).getNodes());
}
public static void main (String args[]){
if(args[0].equals("stripreflexive") && args.length >= 2){
try {
System.out.println( new DOTWriter().getDOT(stripReflexiveEdges(args[1])));
} catch (IOException e) {
// TODO Auto-generated catch block
e.printStackTrace();
}
}
}
}