net.automatalib.util.minimizer.HashMapInitialPartitioning Maven / Gradle / Ivy
Go to download
Show more of this group Show more artifacts with this name
Show all versions of automata-util Show documentation
Show all versions of automata-util Show documentation
This artifact provides various common utility operations for analyzing and manipulating
automata and graphs, such as traversal, minimization and copying.
/* Copyright (C) 2013 TU Dortmund
* This file is part of AutomataLib, http://www.automatalib.net/.
*
* AutomataLib is free software; you can redistribute it and/or
* modify it under the terms of the GNU Lesser General Public
* License version 3.0 as published by the Free Software Foundation.
*
* AutomataLib is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
* Lesser General Public License for more details.
*
* You should have received a copy of the GNU Lesser General Public
* License along with AutomataLib; if not, see
* http://www.gnu.de/documents/lgpl.en.html.
*/
package net.automatalib.util.minimizer;
import java.util.Collection;
import java.util.HashMap;
import java.util.Map;
import net.automatalib.graphs.UniversalIndefiniteGraph;
/**
*
* @author Malte Isberner
*
* @param state class.
* @param transition
*/
class HashMapInitialPartitioning implements
InitialPartitioning {
private final Map> initialBlockMap
= new HashMap>();
private final UniversalIndefiniteGraph graph;
private int numExistingBlocks;
public HashMapInitialPartitioning(UniversalIndefiniteGraph graph) {
this.graph = graph;
}
@Override
public Block getBlock(S origState) {
Object clazz = graph.getNodeProperty(origState);
Block block = initialBlockMap.get(clazz);
if(block == null) {
block = new Block(numExistingBlocks++);
initialBlockMap.put(clazz, block);
}
return block;
}
@Override
public Collection> getInitialBlocks() {
return initialBlockMap.values();
}
}