2 * Jalview - A Sequence Alignment Editor and Viewer ($$Version-Rel$$)
3 * Copyright (C) $$Year-Rel$$ The Jalview Authors
5 * This file is part of Jalview.
7 * Jalview is free software: you can redistribute it and/or
8 * modify it under the terms of the GNU General Public License
9 * as published by the Free Software Foundation, either version 3
10 * of the License, or (at your option) any later version.
12 * Jalview is distributed in the hope that it will be useful, but
13 * WITHOUT ANY WARRANTY; without even the implied warranty
14 * of MERCHANTABILITY or FITNESS FOR A PARTICULAR
15 * PURPOSE. See the GNU General Public License for more details.
17 * You should have received a copy of the GNU General Public License
18 * along with Jalview. If not, see <http://www.gnu.org/licenses/>.
19 * The Jalview Authors are detailed in the 'AUTHORS' file.
21 package jalview.analysis;
23 //import jalview.datamodel.AlignmentView;
24 import jalview.datamodel.AlignmentI;
25 import jalview.datamodel.SequenceI;
26 import jalview.gui.Desktop;
27 import jalview.gui.JvOptionPane;
28 import jalview.viewmodel.AlignmentViewport;
30 import java.util.Comparator;
31 import java.util.Hashtable;
32 import java.util.HashSet;
33 import java.util.TreeSet;
36 * @Author MorellThomas
39 public class Connectivity
43 * Returns the number of unique connections for each sequence
44 * only connections with a score of above 0 count
47 * @param scores alignment scores
49 * @return connectivity
51 public static Hashtable<SequenceI, Integer> getConnectivity(AlignmentViewport av, float[][] scores, byte dim) throws RuntimeException
53 SequenceI[] sequences = av.getAlignment().getSequencesArray();
55 Hashtable<SequenceI, Integer> connectivity = new Hashtable<SequenceI, Integer>();
56 // for each unique connection
57 for (int i = 0; i < sequences.length; i++)
59 connectivity.putIfAbsent(sequences[i], 0);
60 for (int j = 0; j < i; j++)
62 connectivity.putIfAbsent(sequences[j], 0);
63 int iOld = connectivity.get(sequences[i]);
64 int jOld = connectivity.get(sequences[j]);
65 // count the connection if its score is not NaN
66 //System.out.println(String.format("%s - %s : %f", sequences[i].getName(), sequences[j].getName(), scores[i][j]));
67 if (!Float.isNaN(scores[i][j]))
69 connectivity.put(sequences[i], ++iOld);
70 connectivity.put(sequences[j], ++jOld);
75 // if a sequence has too few connections, abort
76 connectivity.forEach((sequence, connection) ->
78 System.out.println(String.format("%s: %d", sequence.getName(), connection));
81 JvOptionPane.showInternalMessageDialog(Desktop.desktop, String.format("Insufficient number of connections for %s (%d, should be %d or more)", sequence.getName(), connection, dim), "Connectivity Error", JvOptionPane.WARNING_MESSAGE);
82 throw new ConnectivityException(sequence.getName(), connection, dim);