fr.lirmm.graphik.util.graph.algorithm.BiconnectedComponentsForHyperGraph Maven / Gradle / Ivy
Go to download
Show more of this group Show more artifacts with this name
Show all versions of integraal-graal-ruleset-analysis Show documentation
Show all versions of integraal-graal-ruleset-analysis Show documentation
Rule base analysis for InteGraal. This is imported from Graal
The newest version!
/*
* Copyright (C) Inria Sophia Antipolis - Méditerranée / LIRMM
* (Université de Montpellier & CNRS) (2014 - 2017)
*
* Contributors :
*
* Clément SIPIETER
* Mélanie KÖNIG
* Swan ROCHER
* Jean-François BAGET
* Michel LECLÈRE
* Marie-Laure MUGNIER
*
*
* This file is part of Graal }
*
*/
public final class BiconnectedComponentsForHyperGraph {
private BiconnectedComponentsForHyperGraph() {
}
public static Data execute(HyperGraph g) {
Data d = new Data();
d.components = new LinkedList>();
d.g = g;
d.i = 0;
d.stack = new LinkedList();
d.number = new int[g.nbVertices() + 1];
d.access = new int[g.nbVertices() + 1];
d.isAccesseur = new boolean[g.nbVertices() + 1];
d.isEntry = new boolean[g.nbVertices() + 1];
d.lowpt = new int[g.nbVertices() + 1];
for (int v = 1; v <= g.nbVertices(); ++v) {
if (d.number[v] == 0) {
// d.stack.push(v);
biconnect(d, v, 0);
}
}
return d;
}
private static void biconnect(Data d, int v, int u) {
d.lowpt[v] = d.number[v] = ++d.i;
d.access[v] = u;
Iterator adjacencyIt = d.g.adjacencyList(v);
int w;
while (adjacencyIt.hasNext()) {
w = adjacencyIt.next();
if (d.number[w] == 0) {
d.stack.push(new DefaultDirectedEdge(v, w));
biconnect(d, w, v);
d.lowpt[v] = Math.min(d.lowpt[v], d.lowpt[w]);
if (d.lowpt[w] >= d.number[v]) {
// start new component
d.isAccesseur[v] = true;
d.isEntry[w] = true;
d.currentComponent = new TreeSet();
d.components.add(d.currentComponent);
while (d.number[d.stack.peek().getTail()] >= d.number[w]) {
DirectedEdge e = d.stack.pop();
d.currentComponent.add(e.getTail());
d.currentComponent.add(e.getHead());
}
// should be (w, v)
DirectedEdge e = d.stack.pop();
d.currentComponent.add(e.getTail());
d.currentComponent.add(e.getHead());
}
} else if (d.number[w] < d.number[v] && w != u) {
d.stack.push(new DefaultDirectedEdge(v, w));
d.lowpt[v] = Math.min(d.lowpt[v], d.number[w]);
}
}
}
public static class Data {
public boolean[] isEntry;
public boolean[] isAccesseur;
int[] numberinv;
LinkedList order;
public int access[];
HyperGraph g;
int i;
public int number[];
int lowpt[];
Deque stack;
List> components;
Set currentComponent;
@Override
public String toString() {
StringBuilder sb = new StringBuilder();
sb.append("")
.append("\t{ vertices : ");
for (int v = 0; v <= g.nbVertices(); ++v) {
sb.append("\t")
.append(v);
}
sb.append(" }\n")
.append("\t{ number : ");
for (int v = 0; v <= g.nbVertices(); ++v) {
sb.append("\t")
.append(number[v]);
}
sb.append(" }\n")
.append("\t{ lowpt : ");
for (int v = 0; v <= g.nbVertices(); ++v) {
sb.append("\t")
.append(lowpt[v]);
}
// sb.append(" }\n")
// .append("\t{ access2 : ");
// for (int v = 0; v <= g.nbVertices(); ++v) {
// sb.append("\t")
// .append(access2[v]);
// }
sb.append(" }\n").append("\t{ access : ");
for (int v = 0; v <= g.nbVertices(); ++v) {
sb.append("\t").append(access[v]);
}
sb.append(" }\n")
.append("\t{ stack :");
for (DirectedEdge e : stack) {
sb.append(e);
}
sb.append(" }\n")
.append("\t{ components :");
for (Set c : components) {
sb.append(c);
}
sb.append(" }\n")
.append("\t{ current component :")
.append(currentComponent)
.append(" }\n}");
return sb.toString();
}
}
public static void main(String args[]) {
DefaultHyperGraph g = new DefaultHyperGraph(20);
g.addEdge(1, 2, 3);
g.addEdge(3, 4);
g.addEdge(14, 10);
g.addEdge(10, 12, 13);
g.addEdge(10, 7, 11);
g.addEdge(7, 11);
g.addEdge(5, 6, 7, 8);
g.addEdge(7, 8, 9);
g.addEdge(8, 19, 20);
g.addEdge(9, 18);
g.addEdge(9, 15);
g.addEdge(15, 16, 17);
// List> components =
// BiconnectedComponentsForHyperGraph.execute(g);
// for (Set c : components) {
// System.out.println(c);
// }
}
}