--- bliss-0.71.orig/debian/blissman.xml
+++ bliss-0.71/debian/blissman.xml
@@ -0,0 +1,113 @@
+<?xml version="1.0" encoding="ISO-8859-1"?>
+<!DOCTYPE refentry PUBLIC "-//OASIS//DTD DocBook XML V4.1.2//EN"
+                   "http://www.oasis-open.org/docbook/xml/4.1.2/docbookx.dtd">
+<!-- lifted from troff+man by doclifter -->
+<refentry id='bliss1'>
+  <refmeta>
+    <refentrytitle>BLISS</refentrytitle>
+    <manvolnum>1</manvolnum>
+    <refmiscinfo class='source'>May 2009</refmiscinfo>
+    <refmiscinfo class='manual'>bliss version 0.50</refmiscinfo>
+  </refmeta>
+  <refnamediv id='name'>
+    <refname>bliss</refname>
+    <refpurpose>Compute automorphism groups and canonical labelings of graphs</refpurpose>
+  </refnamediv>
+  <!-- body begins here -->
+  <refsynopsisdiv id='synopsis'>
+    <cmdsynopsis>
+      <command>bliss</command>    
+      <arg choice='opt'><replaceable>options</replaceable></arg>
+      <arg choice='opt'><arg choice='plain'><replaceable>&lt;graph</replaceable></arg><arg choice='plain'><replaceable>file&gt;</replaceable></arg></arg>
+    </cmdsynopsis>
+  </refsynopsisdiv>
+
+
+  <refsect1 id='description'><title>DESCRIPTION</title>
+  <para>Tool for computing automorphism groups and canonical labelings of graphs</para>
+  <variablelist remap='TP'>
+    <varlistentry>
+      <term><option>-directed</option></term>
+      <listitem>
+	<para>the input graph is directed</para>
+      </listitem>
+    </varlistentry>
+    <varlistentry>
+      <term><option>-can</option></term>
+      <listitem>
+	<para>compute canonical form</para>
+      </listitem>
+    </varlistentry>
+    <varlistentry>
+      <term><option>-ocan</option>=<emphasis remap='I'>f</emphasis></term>
+      <listitem>
+	<para>compute canonical form and output it in file f</para>
+      </listitem>
+    </varlistentry>
+    <varlistentry>
+      <term><option>-v</option>=<emphasis remap='I'>N</emphasis></term>
+      <listitem>
+	<para>set verbose level to N; N &gt;= 0 and 1 by default</para>
+      </listitem>
+    </varlistentry>
+    <varlistentry>
+      <term><option>-sh</option>=<emphasis remap='I'>x</emphasis></term>
+      <listitem>
+	<para>select splitting heuristics, where x is</para>
+	<variablelist>
+	  <varlistentry>
+	    <term>f</term>
+	    <listitem>
+	      <para>first non-singleton cell</para>
+	    </listitem>
+	  </varlistentry>
+	  <varlistentry>
+	    <term>fl</term>
+	    <listitem>
+	      <para>first largest non-singleton cell</para>
+	    </listitem>
+	  </varlistentry>
+	  <varlistentry>
+	    <term>fs</term>
+	    <listitem>
+	      <para>first smallest non-singleton cell</para>
+	    </listitem>
+	  </varlistentry>
+	  <varlistentry>
+	    <term>fm</term>
+	    <listitem>
+	      <para>first maximally non-trivially connected non-singleton cell [default]</para>
+	    </listitem>
+	  </varlistentry>
+	  <varlistentry>
+	    <term>flm</term>
+	    <listitem>
+	      <para>first largest maximally non-trivially connected non-singleton cell</para>
+	    </listitem>
+	  </varlistentry>
+	  <varlistentry>
+	    <term>fsm</term>
+	    <listitem>
+	      <para>first smallest maximally non-trivially connected non-singleton cell</para>
+	    </listitem>
+	  </varlistentry>
+	</variablelist>
+      </listitem>
+    </varlistentry>
+    <varlistentry>
+      <term><option>-version</option></term>
+      <listitem>
+	<para>print the version number and exit</para>
+      </listitem>
+    </varlistentry>
+    <varlistentry>
+      <term><option>-help</option></term>
+      <listitem>
+	<para>print help and exit</para>
+      </listitem>
+    </varlistentry>
+  </variablelist>
+</refsect1>
+
+</refentry>
+
--- bliss-0.71.orig/debian/libbliss1d.symbols
+++ bliss-0.71/debian/libbliss1d.symbols
@@ -0,0 +1,286 @@
+libbliss.so.1d libbliss1d #MINVER#
+ _ZN5bliss11UintSeqHash6updateEj@Base 0.50
+ _ZN5bliss11fatal_errorEPKcz@Base 0.71
+ _ZN5bliss13AbstractGraph14canonical_formERNS_5StatsEPFvPvjPKjES3_@Base 0.71
+#MISSING: 0.71# _ZN5bliss13AbstractGraph14canonical_formERNS_7t_StatsEPFvPvjPKjES3_@Base 0.50
+ _ZN5bliss13AbstractGraph15is_automorphismEPj@Base 0.50
+ _ZN5bliss13AbstractGraph15long_prune_initEv@Base 0.50
+ _ZN5bliss13AbstractGraph15long_prune_swapEjj@Base 0.50
+ _ZN5bliss13AbstractGraph15update_labelingEPj@Base 0.50
+ _ZN5bliss13AbstractGraph16set_verbose_fileEP8_IO_FILE@Base 0.50
+ _ZN5bliss13AbstractGraph17reset_permutationEPj@Base 0.50
+ _ZN5bliss13AbstractGraph17set_verbose_levelEj@Base 0.50
+ _ZN5bliss13AbstractGraph18cert_add_redundantEjjj@Base 0.71
+ _ZN5bliss13AbstractGraph18find_automorphismsERNS_5StatsEPFvPvjPKjES3_@Base 0.71
+#MISSING: 0.71# _ZN5bliss13AbstractGraph18find_automorphismsERNS_7t_StatsEPFvPvjPKjES3_@Base 0.50
+ _ZN5bliss13AbstractGraph19long_prune_get_mcrsEj@Base 0.50
+ _ZN5bliss13AbstractGraph19refine_to_equitableEPNS_9Partition4CellE@Base 0.50
+ _ZN5bliss13AbstractGraph19refine_to_equitableEPNS_9Partition4CellES3_@Base 0.50
+ _ZN5bliss13AbstractGraph19refine_to_equitableEv@Base 0.50
+ _ZN5bliss13AbstractGraph20long_prune_get_fixedEj@Base 0.50
+ _ZN5bliss13AbstractGraph21long_prune_deallocateEv@Base 0.50
+ _ZN5bliss13AbstractGraph22do_refine_to_equitableEv@Base 0.50
+ _ZN5bliss13AbstractGraph24long_prune_allocget_mcrsEj@Base 0.50
+ _ZN5bliss13AbstractGraph24update_orbit_informationERNS_5OrbitEPKj@Base 0.50
+ _ZN5bliss13AbstractGraph25long_prune_allocget_fixedEj@Base 0.50
+ _ZN5bliss13AbstractGraph25nucr_find_first_componentEj@Base 0.71
+ _ZN5bliss13AbstractGraph25nucr_find_first_componentEjRSt6vectorIjSaIjEERjRPNS_9Partition4CellE@Base 0.71
+ _ZN5bliss13AbstractGraph27long_prune_add_automorphismEPKj@Base 0.50
+ _ZN5bliss13AbstractGraph31update_labeling_and_its_inverseEPjS1_@Base 0.50
+ _ZN5bliss13AbstractGraph6searchEbRNS_5StatsE@Base 0.71
+#MISSING: 0.71# _ZN5bliss13AbstractGraph6searchEbRNS_7t_StatsE@Base 0.50
+ _ZN5bliss13AbstractGraph8cert_addEjjj@Base 0.71
+ _ZN5bliss13AbstractGraphC1Ev@Base 0.50
+ _ZN5bliss13AbstractGraphC2Ev@Base 0.50
+ _ZN5bliss13AbstractGraphD0Ev@Base 0.50
+ _ZN5bliss13AbstractGraphD1Ev@Base 0.50
+ _ZN5bliss13AbstractGraphD2Ev@Base 0.50
+ _ZN5bliss14is_permutationERKSt6vectorIjSaIjEE@Base 0.71
+ _ZN5bliss14is_permutationEjPKj@Base 0.71
+ _ZN5bliss17print_permutationEP8_IO_FILERKSt6vectorIjSaIjEEj@Base 0.71
+ _ZN5bliss17print_permutationEP8_IO_FILEjPKjj@Base 0.50
+ _ZN5bliss4Heap4initEj@Base 0.50
+ _ZN5bliss4Heap6insertEj@Base 0.50
+ _ZN5bliss4Heap6removeEv@Base 0.50
+ _ZN5bliss4Heap6upheapEj@Base 0.50
+ _ZN5bliss4Heap8downheapEj@Base 0.50
+ _ZN5bliss4HeapD1Ev@Base 0.50
+ _ZN5bliss4HeapD2Ev@Base 0.50
+ _ZN5bliss5Graph10add_vertexEj@Base 0.50
+ _ZN5bliss5Graph10sort_edgesEv@Base 0.50
+ _ZN5bliss5Graph11read_dimacsEP8_IO_FILES2_@Base 0.50
+ _ZN5bliss5Graph12change_colorEjj@Base 0.50
+ _ZN5bliss5Graph12write_dimacsEP8_IO_FILE@Base 0.50
+ _ZN5bliss5Graph15is_automorphismEPj@Base 0.50
+ _ZN5bliss5Graph16degree_invariantEPKS0_j@Base 0.71
+#MISSING: 0.71# _ZN5bliss5Graph16degree_invariantEPS0_j@Base 0.50
+#MISSING: 0.71# _ZN5bliss5Graph16sh_first_largestEPNS_9Partition4CellE@Base 0.50
+ _ZN5bliss5Graph16sh_first_largestEv@Base 0.71
+#MISSING: 0.71# _ZN5bliss5Graph17sh_first_smallestEPNS_9Partition4CellE@Base 0.50
+ _ZN5bliss5Graph17sh_first_smallestEv@Base 0.71
+ _ZN5bliss5Graph18selfloop_invariantEPKS0_j@Base 0.71
+#MISSING: 0.71# _ZN5bliss5Graph18selfloop_invariantEPS0_j@Base 0.50
+ _ZN5bliss5Graph22initialize_certificateEv@Base 0.50
+ _ZN5bliss5Graph22remove_duplicate_edgesEv@Base 0.50
+ _ZN5bliss5Graph22vertex_color_invariantEPKS0_j@Base 0.71
+#MISSING: 0.71# _ZN5bliss5Graph22vertex_color_invariantEPS0_j@Base 0.50
+#MISSING: 0.71# _ZN5bliss5Graph23sh_first_max_neighboursEPNS_9Partition4CellE@Base 0.50
+ _ZN5bliss5Graph23sh_first_max_neighboursEv@Base 0.71
+ _ZN5bliss5Graph25nucr_find_first_componentEj@Base 0.71
+ _ZN5bliss5Graph25nucr_find_first_componentEjRSt6vectorIjSaIjEERjRPNS_9Partition4CellE@Base 0.71
+ _ZN5bliss5Graph27split_neighbourhood_of_cellEPNS_9Partition4CellE@Base 0.50
+ _ZN5bliss5Graph29find_next_cell_to_be_splittedEPNS_9Partition4CellE@Base 0.50
+ _ZN5bliss5Graph29refine_according_to_invariantEPFjPKS0_jE@Base 0.71
+#MISSING: 0.71# _ZN5bliss5Graph29refine_according_to_invariantEPFjPS0_jE@Base 0.50
+#MISSING: 0.71# _ZN5bliss5Graph31sh_first_largest_max_neighboursEPNS_9Partition4CellE@Base 0.50
+ _ZN5bliss5Graph31sh_first_largest_max_neighboursEv@Base 0.71
+ _ZN5bliss5Graph32make_initial_equitable_partitionEv@Base 0.50
+#MISSING: 0.71# _ZN5bliss5Graph32sh_first_smallest_max_neighboursEPNS_9Partition4CellE@Base 0.50
+ _ZN5bliss5Graph32sh_first_smallest_max_neighboursEv@Base 0.71
+ _ZN5bliss5Graph32split_neighbourhood_of_unit_cellEPNS_9Partition4CellE@Base 0.50
+#MISSING: 0.71# _ZN5bliss5Graph3cmpEPS0_@Base 0.50
+ _ZN5bliss5Graph3cmpERS0_@Base 0.71
+ _ZN5bliss5Graph6Vertex10sort_edgesEv@Base 0.50
+#MISSING: 0.71# _ZN5bliss5Graph6Vertex22remove_duplicate_edgesEPb@Base 0.50
+ _ZN5bliss5Graph6Vertex22remove_duplicate_edgesERSt6vectorIbSaIbEE@Base 0.71
+ _ZN5bliss5Graph6Vertex8add_edgeEj@Base 0.50
+ _ZN5bliss5Graph6VertexC1Ev@Base 0.50
+ _ZN5bliss5Graph6VertexC2Ev@Base 0.50
+ _ZN5bliss5Graph6VertexD1Ev@Base 0.50
+ _ZN5bliss5Graph6VertexD2Ev@Base 0.50
+ _ZN5bliss5Graph8add_edgeEjj@Base 0.50
+ _ZN5bliss5Graph8get_hashEv@Base 0.50
+#MISSING: 0.71# _ZN5bliss5Graph8sh_firstEPNS_9Partition4CellE@Base 0.50
+ _ZN5bliss5Graph8sh_firstEv@Base 0.71
+ _ZN5bliss5Graph9write_dotEP8_IO_FILE@Base 0.50
+ _ZN5bliss5Graph9write_dotEPKc@Base 0.50
+ _ZN5bliss5GraphC1Ej@Base 0.50
+ _ZN5bliss5GraphC2Ej@Base 0.50
+ _ZN5bliss5GraphD0Ev@Base 0.50
+ _ZN5bliss5GraphD1Ev@Base 0.50
+ _ZN5bliss5GraphD2Ev@Base 0.50
+ _ZN5bliss5Orbit12merge_orbitsEPNS0_10OrbitEntryES2_@Base 0.50
+ _ZN5bliss5Orbit12merge_orbitsEjj@Base 0.50
+ _ZN5bliss5Orbit4initEj@Base 0.50
+ _ZN5bliss5Orbit5resetEv@Base 0.50
+ _ZN5bliss5OrbitC1Ev@Base 0.50
+ _ZN5bliss5OrbitC2Ev@Base 0.50
+ _ZN5bliss5OrbitD1Ev@Base 0.50
+ _ZN5bliss5OrbitD2Ev@Base 0.50
+ _ZN5bliss5Timer12get_durationEv@Base 0.50
+ _ZN5bliss5Timer5resetEv@Base 0.50
+ _ZN5bliss5TimerC1Ev@Base 0.50
+ _ZN5bliss5TimerC2Ev@Base 0.50
+ _ZN5bliss7Digraph10add_vertexEj@Base 0.50
+ _ZN5bliss7Digraph10sort_edgesEv@Base 0.50
+ _ZN5bliss7Digraph11read_dimacsEP8_IO_FILES2_@Base 0.50
+ _ZN5bliss7Digraph12change_colorEjj@Base 0.50
+ _ZN5bliss7Digraph12write_dimacsEP8_IO_FILE@Base 0.50
+ _ZN5bliss7Digraph15is_automorphismEPj@Base 0.50
+#MISSING: 0.71# _ZN5bliss7Digraph16sh_first_largestEPNS_9Partition4CellE@Base 0.50
+ _ZN5bliss7Digraph16sh_first_largestEv@Base 0.71
+#MISSING: 0.71# _ZN5bliss7Digraph17sh_first_smallestEPNS_9Partition4CellE@Base 0.50
+ _ZN5bliss7Digraph17sh_first_smallestEv@Base 0.71
+ _ZN5bliss7Digraph18indegree_invariantEPKS0_j@Base 0.71
+#MISSING: 0.71# _ZN5bliss7Digraph18indegree_invariantEPS0_j@Base 0.50
+ _ZN5bliss7Digraph18selfloop_invariantEPKS0_j@Base 0.71
+#MISSING: 0.71# _ZN5bliss7Digraph18selfloop_invariantEPS0_j@Base 0.50
+ _ZN5bliss7Digraph19outdegree_invariantEPKS0_j@Base 0.71
+#MISSING: 0.71# _ZN5bliss7Digraph19outdegree_invariantEPS0_j@Base 0.50
+ _ZN5bliss7Digraph22initialize_certificateEv@Base 0.50
+ _ZN5bliss7Digraph22remove_duplicate_edgesEv@Base 0.50
+ _ZN5bliss7Digraph22vertex_color_invariantEPKS0_j@Base 0.71
+#MISSING: 0.71# _ZN5bliss7Digraph22vertex_color_invariantEPS0_j@Base 0.50
+#MISSING: 0.71# _ZN5bliss7Digraph23sh_first_max_neighboursEPNS_9Partition4CellE@Base 0.50
+ _ZN5bliss7Digraph23sh_first_max_neighboursEv@Base 0.71
+ _ZN5bliss7Digraph25nucr_find_first_componentEj@Base 0.71
+ _ZN5bliss7Digraph25nucr_find_first_componentEjRSt6vectorIjSaIjEERjRPNS_9Partition4CellE@Base 0.71
+ _ZN5bliss7Digraph27split_neighbourhood_of_cellEPNS_9Partition4CellE@Base 0.50
+ _ZN5bliss7Digraph29find_next_cell_to_be_splittedEPNS_9Partition4CellE@Base 0.50
+ _ZN5bliss7Digraph29refine_according_to_invariantEPFjPKS0_jE@Base 0.71
+#MISSING: 0.71# _ZN5bliss7Digraph29refine_according_to_invariantEPFjPS0_jE@Base 0.50
+#MISSING: 0.71# _ZN5bliss7Digraph31sh_first_largest_max_neighboursEPNS_9Partition4CellE@Base 0.50
+ _ZN5bliss7Digraph31sh_first_largest_max_neighboursEv@Base 0.71
+ _ZN5bliss7Digraph32make_initial_equitable_partitionEv@Base 0.50
+#MISSING: 0.71# _ZN5bliss7Digraph32sh_first_smallest_max_neighboursEPNS_9Partition4CellE@Base 0.50
+ _ZN5bliss7Digraph32sh_first_smallest_max_neighboursEv@Base 0.71
+ _ZN5bliss7Digraph32split_neighbourhood_of_unit_cellEPNS_9Partition4CellE@Base 0.50
+ _ZN5bliss7Digraph3cmpERS0_@Base 0.71
+ _ZN5bliss7Digraph6Vertex10sort_edgesEv@Base 0.50
+ _ZN5bliss7Digraph6Vertex11add_edge_toEj@Base 0.50
+ _ZN5bliss7Digraph6Vertex13add_edge_fromEj@Base 0.50
+#MISSING: 0.71# _ZN5bliss7Digraph6Vertex22remove_duplicate_edgesEPb@Base 0.50
+ _ZN5bliss7Digraph6Vertex22remove_duplicate_edgesERSt6vectorIbSaIbEE@Base 0.71
+ _ZN5bliss7Digraph6VertexC1Ev@Base 0.50
+ _ZN5bliss7Digraph6VertexC2Ev@Base 0.50
+ _ZN5bliss7Digraph6VertexD1Ev@Base 0.50
+ _ZN5bliss7Digraph6VertexD2Ev@Base 0.50
+ _ZN5bliss7Digraph8add_edgeEjj@Base 0.50
+ _ZN5bliss7Digraph8get_hashEv@Base 0.50
+#MISSING: 0.71# _ZN5bliss7Digraph8sh_firstEPNS_9Partition4CellE@Base 0.50
+ _ZN5bliss7Digraph8sh_firstEv@Base 0.71
+ _ZN5bliss7Digraph9write_dotEP8_IO_FILE@Base 0.50
+ _ZN5bliss7Digraph9write_dotEPKc@Base 0.50
+ _ZN5bliss7DigraphC1Ej@Base 0.50
+ _ZN5bliss7DigraphC2Ej@Base 0.50
+ _ZN5bliss7DigraphD0Ev@Base 0.50
+ _ZN5bliss7DigraphD1Ev@Base 0.50
+ _ZN5bliss7DigraphD2Ev@Base 0.50
+ _ZN5bliss9Partition10split_cellEPNS0_4CellE@Base 0.50
+ _ZN5bliss9Partition10zplit_cellEPNS0_4CellEb@Base 0.50
+ _ZN5bliss9Partition13individualizeEPNS0_4CellEj@Base 0.50
+ _ZN5bliss9Partition14cr_split_levelEjRKSt6vectorIjSaIjEE@Base 0.71
+ _ZN5bliss9Partition14shellsort_cellEPNS0_4CellE@Base 0.50
+#MISSING: 0.71# _ZN5bliss9Partition15print_signatureEP8_IO_FILE@Base 0.50
+ _ZN5bliss9Partition16aux_split_in_twoEPNS0_4CellEj@Base 0.50
+#MISSING: 0.71# _ZN5bliss9Partition17consistency_checkEv@Base 0.50
+ _ZN5bliss9Partition18cr_create_at_levelEjj@Base 0.71
+ _ZN5bliss9Partition18dcs_cumulate_countEj@Base 0.50
+ _ZN5bliss9Partition19set_backtrack_pointEv@Base 0.50
+ _ZN5bliss9Partition19splitting_queue_addEPNS0_4CellE@Base 0.71
+ _ZN5bliss9Partition20goto_backtrack_pointEj@Base 0.50
+ _ZN5bliss9Partition20sort_and_split_cell1EPNS0_4CellE@Base 0.50
+#MISSING: 0.71# _ZN5bliss9Partition21clear_splitting_queueEv@Base 0.50
+ _ZN5bliss9Partition21splitting_queue_clearEv@Base 0.71
+#MISSING: 0.71# _ZN5bliss9Partition22add_in_splitting_queueEPNS0_4CellE@Base 0.50
+ _ZN5bliss9Partition22cr_get_backtrack_pointEv@Base 0.71
+ _ZN5bliss9Partition22sort_and_split_cell255EPNS0_4CellEj@Base 0.50
+ _ZN5bliss9Partition23cr_goto_backtrack_pointEj@Base 0.71
+ _ZN5bliss9Partition26cr_create_at_level_trailedEjj@Base 0.71
+ _ZN5bliss9Partition4initEj@Base 0.50
+#MISSING: 0.71# _ZN5bliss9Partition5printEP8_IO_FILE@Base 0.50
+ _ZN5bliss9Partition7cr_freeEv@Base 0.71
+ _ZN5bliss9Partition7cr_initEv@Base 0.71
+ _ZN5bliss9Partition9clear_ivsEPNS0_4CellE@Base 0.50
+ _ZN5bliss9PartitionC1Ev@Base 0.50
+ _ZN5bliss9PartitionC2Ev@Base 0.50
+ _ZN5bliss9PartitionD1Ev@Base 0.50
+ _ZN5bliss9PartitionD2Ev@Base 0.50
+ _ZNK5bliss13AbstractGraph15is_automorphismERKSt6vectorIjSaIjEE@Base 0.71
+ _ZNK5bliss5Graph12is_equitableEv@Base 0.50
+ _ZNK5bliss5Graph15is_automorphismERKSt6vectorIjSaIjEE@Base 0.71
+ _ZNK5bliss5Graph16get_nof_verticesEv@Base 0.50
+ _ZNK5bliss5Graph7permuteEPKj@Base 0.50
+ _ZNK5bliss5Graph7permuteERKSt6vectorIjSaIjEE@Base 0.71
+ _ZNK5bliss5Orbit10orbit_sizeEj@Base 0.50
+ _ZNK5bliss5Orbit25is_minimal_representativeEj@Base 0.50
+ _ZNK5bliss5Orbit26get_minimal_representativeEj@Base 0.50
+ _ZNK5bliss7Digraph12is_equitableEv@Base 0.50
+ _ZNK5bliss7Digraph15is_automorphismERKSt6vectorIjSaIjEE@Base 0.71
+ _ZNK5bliss7Digraph16get_nof_verticesEv@Base 0.50
+ _ZNK5bliss7Digraph7permuteEPKj@Base 0.50
+ _ZNK5bliss7Digraph7permuteERKSt6vectorIjSaIjEE@Base 0.71
+ _ZNK5bliss9Partition15print_signatureEP8_IO_FILEb@Base 0.71
+ _ZNK5bliss9Partition5printEP8_IO_FILEb@Base 0.71
+#MISSING: 0.71# _ZNKSt13_Bit_iteratorplEl@Base 0.50
+#MISSING: 0.71# _ZNKSt6vectorIN5bliss9LevelInfoESaIS1_EE12_M_check_lenEmPKc@Base 0.50
+#MISSING: 0.71# _ZNKSt6vectorIjSaIjEE12_M_check_lenEmPKc@Base 0.50
+#MISSING: 0.71# _ZNSt11__copy_moveILb0ELb1ESt26random_access_iterator_tagE8__copy_mIjEEPT_PKS3_S6_S4_@Base 0.50
+ _ZNSt3setIjSt4lessIjESaIjEED1Ev@Base 0.50
+ _ZNSt3setIjSt4lessIjESaIjEED2Ev@Base 0.71
+ _ZNSt6vectorIN5bliss13AbstractGraph6CR_CEPESaIS2_EE13_M_insert_auxEN9__gnu_cxx17__normal_iteratorIPS2_S4_EERKS2_@Base 0.71
+ _ZNSt6vectorIN5bliss13AbstractGraph6CR_CEPESaIS2_EE14_M_fill_insertEN9__gnu_cxx17__normal_iteratorIPS2_S4_EEmRKS2_@Base 0.71
+#MISSING: 0.71# _ZNSt6vectorIN5bliss5Graph6VertexESaIS2_EE14_M_fill_insertEN9__gnu_cxx17__normal_iteratorIPS2_S4_EEmRKS2_@Base 0.50
+#MISSING: 0.71# _ZNSt6vectorIN5bliss5Graph6VertexESaIS2_EED1Ev@Base 0.50
+#MISSING: 0.71# _ZNSt6vectorIN5bliss7Digraph6VertexESaIS2_EE14_M_fill_insertEN9__gnu_cxx17__normal_iteratorIPS2_S4_EEmRKS2_@Base 0.50
+#MISSING: 0.71# _ZNSt6vectorIN5bliss7Digraph6VertexESaIS2_EED1Ev@Base 0.50
+#MISSING: 0.71# _ZNSt6vectorIN5bliss8PathInfoESaIS1_EE13_M_insert_auxEN9__gnu_cxx17__normal_iteratorIPS1_S3_EERKS1_@Base 0.50
+ _ZNSt6vectorIN5bliss8TreeNodeESaIS1_EE14_M_fill_insertEN9__gnu_cxx17__normal_iteratorIPS1_S3_EEmRKS1_@Base 0.71
+#MISSING: 0.71# _ZNSt6vectorIN5bliss9LevelInfoESaIS1_EE13_M_insert_auxEN9__gnu_cxx17__normal_iteratorIPS1_S3_EERKS1_@Base 0.50
+#MISSING: 0.71# _ZNSt6vectorIN5bliss9LevelInfoESaIS1_EE14_M_fill_insertEN9__gnu_cxx17__normal_iteratorIPS1_S3_EEmRKS1_@Base 0.50
+#MISSING: 0.71# _ZNSt6vectorIN5bliss9LevelInfoESaIS1_EED1Ev@Base 0.50
+#MISSING: 0.71# _ZNSt6vectorIN5bliss9Partition13BacktrackInfoESaIS2_EE13_M_insert_auxEN9__gnu_cxx17__normal_iteratorIPS2_S4_EERKS2_@Base 0.50
+#MISSING: 0.71# _ZNSt6vectorIN5bliss9Partition13BacktrackInfoESaIS2_EE14_M_fill_insertEN9__gnu_cxx17__normal_iteratorIPS2_S4_EEmRKS2_@Base 0.50
+ _ZNSt6vectorIPN5bliss9Partition4CellESaIS3_EE13_M_insert_auxEN9__gnu_cxx17__normal_iteratorIPS3_S5_EERKS3_@Base 0.71
+ _ZNSt6vectorIPN5bliss9Partition4CellESaIS3_EED1Ev@Base 0.71
+ _ZNSt6vectorIPN5bliss9Partition4CellESaIS3_EED2Ev@Base 0.71
+ _ZNSt6vectorIPS_IbSaIbEESaIS2_EE14_M_fill_insertEN9__gnu_cxx17__normal_iteratorIPS2_S4_EEmRKS2_@Base 0.50
+ _ZNSt6vectorIPS_IbSaIbEESaIS2_EED1Ev@Base 0.50
+ _ZNSt6vectorIPS_IbSaIbEESaIS2_EED2Ev@Base 0.71
+ _ZNSt6vectorISt3setIjSt4lessIjESaIjEESaIS4_EE14_M_fill_insertEN9__gnu_cxx17__normal_iteratorIPS4_S6_EEmRKS4_@Base 0.71
+ _ZNSt6vectorIbSaIbEE14_M_fill_insertESt13_Bit_iteratormb@Base 0.71
+#MISSING: 0.71# _ZNSt6vectorIbSaIbEEC1EmRKbRKS0_@Base 0.50
+ _ZNSt6vectorIbSaIbEED1Ev@Base 0.71
+ _ZNSt6vectorIbSaIbEED2Ev@Base 0.71
+ _ZNSt6vectorIjSaIjEE13_M_insert_auxEN9__gnu_cxx17__normal_iteratorIPjS1_EERKj@Base 0.50
+ _ZNSt6vectorIjSaIjEE14_M_fill_insertEN9__gnu_cxx17__normal_iteratorIPjS1_EEmRKj@Base 0.50
+#MISSING: 0.71# _ZNSt6vectorIjSaIjEED1Ev@Base 0.50
+ _ZNSt6vectorIjSaIjEEaSERKS1_@Base 0.50
+ _ZNSt8_Rb_treeIjjSt9_IdentityIjESt4lessIjESaIjEE16_M_insert_uniqueERKj@Base 0.71
+ _ZNSt8_Rb_treeIjjSt9_IdentityIjESt4lessIjESaIjEE7_M_copyEPKSt13_Rb_tree_nodeIjEPS7_@Base 0.50
+ _ZNSt8_Rb_treeIjjSt9_IdentityIjESt4lessIjESaIjEE8_M_eraseEPSt13_Rb_tree_nodeIjE@Base 0.50
+ _ZNSt8_Rb_treeIjjSt9_IdentityIjESt4lessIjESaIjEEaSERKS5_@Base 0.71
+ _ZSt13__adjust_heapIN9__gnu_cxx17__normal_iteratorIPjSt6vectorIjSaIjEEEEljEvT_T0_S8_T1_@Base 0.50
+ _ZSt16__insertion_sortIN9__gnu_cxx17__normal_iteratorIPjSt6vectorIjSaIjEEEEEvT_S7_@Base 0.71
+ _ZSt16__introsort_loopIN9__gnu_cxx17__normal_iteratorIPjSt6vectorIjSaIjEEEElEvT_S7_T0_@Base 0.50
+ _ZSt19__move_median_firstIN9__gnu_cxx17__normal_iteratorIPjSt6vectorIjSaIjEEEEEvT_S7_S7_@Base 0.71
+#MISSING: 0.71# _ZSt22__uninitialized_move_aIPN5bliss5Graph6VertexES3_SaIS2_EET0_T_S6_S5_RT1_@Base 0.50
+#MISSING: 0.71# _ZSt22__uninitialized_move_aIPN5bliss7Digraph6VertexES3_SaIS2_EET0_T_S6_S5_RT1_@Base 0.50
+#MISSING: 0.71# _ZSt22__uninitialized_move_aIPN5bliss9LevelInfoES2_SaIS1_EET0_T_S5_S4_RT1_@Base 0.50
+#MISSING: 0.71# _ZSt22__uninitialized_move_aIPN5bliss9Partition13BacktrackInfoES3_SaIS2_EET0_T_S6_S5_RT1_@Base 0.50
+#MISSING: 0.71# _ZSt24__uninitialized_fill_n_aIPN5bliss5Graph6VertexEmS2_S2_EvT_T0_RKT1_RSaIT2_E@Base 0.50
+#MISSING: 0.71# _ZSt24__uninitialized_fill_n_aIPN5bliss7Digraph6VertexEmS2_S2_EvT_T0_RKT1_RSaIT2_E@Base 0.50
+#MISSING: 0.71# _ZSt4fillSt13_Bit_iteratorS_RKb@Base 0.50
+ _ZSt8_DestroyIPN5bliss8TreeNodeEEvT_S3_@Base 0.71
+ _ZTIN5bliss13AbstractGraphE@Base 0.50
+ _ZTIN5bliss5GraphE@Base 0.50
+ _ZTIN5bliss7DigraphE@Base 0.50
+ _ZTSN5bliss13AbstractGraphE@Base 0.50
+ _ZTSN5bliss5GraphE@Base 0.50
+ _ZTSN5bliss7DigraphE@Base 0.50
+ _ZTVN5bliss13AbstractGraphE@Base 0.50
+ _ZTVN5bliss5GraphE@Base 0.50
+ _ZTVN5bliss7DigraphE@Base 0.50
+ bliss_add_edge@Base 0.50
+ bliss_add_vertex@Base 0.50
+ bliss_cmp@Base 0.50
+ bliss_find_automorphisms@Base 0.50
+ bliss_find_canonical_labeling@Base 0.50
+ bliss_get_nof_vertices@Base 0.50
+ bliss_hash@Base 0.50
+ bliss_new@Base 0.50
+ bliss_permute@Base 0.50
+ bliss_read_dimacs@Base 0.50
+ bliss_release@Base 0.50
+ bliss_write_dimacs@Base 0.50
+ bliss_write_dot@Base 0.50
--- bliss-0.71.orig/debian/rules
+++ bliss-0.71/debian/rules
@@ -0,0 +1,23 @@
+#!/usr/bin/make -f
+
+# Uncomment this to turn on verbose mode.
+#export DH_VERBOSE=1
+
+DB2MAN=/usr/share/sgml/docbook/stylesheet/xsl/nwalsh/manpages/docbook.xsl
+XP=xsltproc -''-nonet
+
+%: 
+	dh $@
+
+override_dh_auto_build: 
+	$(MAKE) -f debian/Makefile.shlib  libbliss.so bliss_shlib
+	# work around bug 622147
+	doxygen && rm -f html/jquery.js
+	$(XP) -o bliss.1 $(DB2MAN) $(CURDIR)/debian/blissman.xml
+
+override_dh_auto_clean:
+	$(MAKE) -f debian/Makefile.shlib clean_shlib
+	rm -rf html
+
+override_dh_auto_install:
+	$(MAKE) -f debian/Makefile.shlib DESTDIR=$(CURDIR)/debian/tmp install_shlib
--- bliss-0.71.orig/debian/changelog
+++ bliss-0.71/debian/changelog
@@ -0,0 +1,19 @@
+bliss (0.71-1) unstable; urgency=low
+
+  * New upstream release
+  * Replace ligatures in description (Closes: #613480)
+  * Change section of libbliss0d to libs (Closes: #614606)
+
+ -- David Bremner <bremner@debian.org>  Thu, 05 May 2011 19:11:51 -0300
+
+bliss (0.50-1.1) unstable; urgency=low
+
+  * NMU.  Build with unversioned libgmp-dev.
+
+ -- Steve M. Robbins <smr@debian.org>  Tue, 15 Mar 2011 01:46:08 -0500
+
+bliss (0.50-1) unstable; urgency=low
+
+  * Initial release (Closes: #528925) 
+
+ -- David Bremner <bremner@debian.org>  Thu, 16 Dec 2010 23:34:03 -0400
--- bliss-0.71.orig/debian/bliss.install
+++ bliss-0.71/debian/bliss.install
@@ -0,0 +1 @@
+bliss usr/bin
--- bliss-0.71.orig/debian/watch
+++ bliss-0.71/debian/watch
@@ -0,0 +1,10 @@
+# Example watch control file for uscan
+# Rename this file to "watch" and then you can run the "uscan" command
+# to check for upstream updates and more.
+# See uscan(1) for format
+
+# Compulsory line, this is a version 3 file
+version=3
+
+http://www.tcs.hut.fi/Software/bliss bliss-(.*)\.zip
+
--- bliss-0.71.orig/debian/dirs
+++ bliss-0.71/debian/dirs
@@ -0,0 +1,5 @@
+usr/bin
+usr/lib
+usr/include/bliss
+
+
--- bliss-0.71.orig/debian/bliss.manpages
+++ bliss-0.71/debian/bliss.manpages
@@ -0,0 +1,2 @@
+bliss.1
+
--- bliss-0.71.orig/debian/README.Debian
+++ bliss-0.71/debian/README.Debian
@@ -0,0 +1,10 @@
+Note that the binary and libraries are built with GMP.
+
+For documentation of the file format, see the bliss homepage
+
+    http://www.tcs.hut.fi/Software/bliss/fileformat.shtml
+
+Hopefully a future release will include more documentation 
+in the package.
+
+ -- David Bremner <bremner@debian.org>, Sat, 25 Dec 2010 13:33:23 -0400
--- bliss-0.71.orig/debian/libbliss-dev.install
+++ bliss-0.71/debian/libbliss-dev.install
@@ -0,0 +1,4 @@
+usr/lib/libbliss.a 
+usr/lib/libbliss.so
+usr/include/bliss
+
--- bliss-0.71.orig/debian/clean
+++ bliss-0.71/debian/clean
@@ -0,0 +1 @@
+bliss.1
--- bliss-0.71.orig/debian/Makefile.shlib
+++ bliss-0.71/debian/Makefile.shlib
@@ -0,0 +1,36 @@
+include Makefile
+
+SONAME=libbliss.so.1d
+SOMINOR=0
+SOFULL=$(SONAME).$(SOMINOR)
+
+GMPSHOBJS=$(addsuffix s, $(GMPOBJS))
+
+default: libbliss.so
+
+%.ogs: %.cc
+	$(CC) -fPIC -c $(CFLAGS) -o $@ $<
+
+libbliss.so: $(GMPSHOBJS)
+	$(CC) -shared -Wl,-soname,$(SONAME) -o $(SOFULL) $^
+	ln -sf $(SOFULL) $(SONAME)
+	ln -sf $(SOFULL) libbliss.so
+
+bliss_shlib: libbliss.so bliss.og
+	$(CC) $(CFLAGS) -o bliss bliss.og -L. -lbliss -lgmp
+
+clean_shlib: clean
+	rm  -f *.ogs *.so*
+
+install_shlib: lib_gmp bliss_shlib libbliss.so
+	mkdir -p $(DESTDIR)/usr/lib
+	cp libbliss.a $(DESTDIR)/usr/lib
+	cp $(SOFULL) $(DESTDIR)/usr/lib
+	cd $(DESTDIR)/usr/lib && \
+		ln -sf $(SOFULL) $(SONAME) && \
+		ln -sf $(SOFULL) libbliss.so
+	mkdir -p $(DESTDIR)/usr/include/bliss
+	cp *.h $(DESTDIR)/usr/include/bliss
+	cp *.hh $(DESTDIR)/usr/include/bliss
+	mkdir -p $(DESTDIR)/usr/bin
+	cp bliss $(DESTDIR)/usr/bin
--- bliss-0.71.orig/debian/control
+++ bliss-0.71/debian/control
@@ -0,0 +1,44 @@
+Source: bliss
+Section: math
+Priority: optional
+Maintainer: David Bremner <bremner@debian.org>
+Build-Depends: debhelper (>= 7.0.50~), libgmp-dev, xsltproc, docbook-xsl, 
+	       docbook-xml, doxygen
+Standards-Version: 3.9.1
+Homepage: http://www.tcs.hut.fi/Software/bliss/index.shtml
+
+Package: bliss
+Architecture: any
+Depends: ${shlibs:Depends}, ${misc:Depends}
+Suggests: libbliss-dev
+Description: tool to compute graph automorphisms and labelings
+ Bliss is a backtracking algorithm based on individualization and
+ refinement for labeling a graph.  Data structures, subroutines, and
+ pruning heuristics especially for fast handling of large and sparse
+ graphs are provided. This package provides the command line tool 
+ bliss; a C++ and C API is also available.
+
+Package: libbliss1d
+Architecture: any
+Depends: ${shlibs:Depends}, ${misc:Depends}
+Suggests: libbliss-dev
+Section: libs
+Description: library to compute graph automorphisms and labelings
+ Bliss is a backtracking algorithm based on individualization and
+ refinement for labeling a graph.  Data structures, subroutines, and
+ pruning heuristics especially for fast handling of large and sparse
+ graphs are provided. This package provides the shared library; a C++
+ and C API is also available.
+ 
+Package: libbliss-dev
+Architecture: any
+Depends: ${misc:Depends}, libbliss1d (=${binary:Version})
+Suggests: bliss
+Section: libdevel
+Description: development files to compute graph automorphisms and labelings
+ Bliss is a backtracking algorithm based on individualization and
+ refinement for labeling a graph.  Data structures, subroutines, and
+ pruning heuristics especially for fast handling of large and sparse
+ graphs are provided. This package provides the C++ and C API; a
+ command line tool is also available.
+
--- bliss-0.71.orig/debian/compat
+++ bliss-0.71/debian/compat
@@ -0,0 +1 @@
+7
--- bliss-0.71.orig/debian/libbliss1d.install
+++ bliss-0.71/debian/libbliss1d.install
@@ -0,0 +1,2 @@
+usr/lib/libbliss.so.1d
+usr/lib/libbliss.so.1d.0
--- bliss-0.71.orig/debian/copyright
+++ bliss-0.71/debian/copyright
@@ -0,0 +1,28 @@
+% The format of this file is (loosely) based on
+%      http://wiki.debian.org/Proposals/CopyrightFormat
+
+Original source download from:
+    http://www.tcs.hut.fi/Software/bliss/
+
+Authors: Tommi Junttila and Petteri Kaski
+
+Files: *
+Copyright: © 2003-2011 Tommi Junttila 
+Licence: GPL3
+License:
+    bliss is free software: you can redistribute it and/or modify
+    it under the terms of the GNU General Public License version 3
+    as published by the Free Software Foundation.
+
+    bliss 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 General Public License for more details.
+  
+Files: debian/*
+Copyright:  © 2009-2011 David Bremner
+License: same as upstream
+
+On Debian systems, the complete text of the GNU General
+Public License version 2 can be found in `/usr/share/common-licenses/GPL-3'.
+
--- bliss-0.71.orig/debian/libbliss-dev.docs
+++ bliss-0.71/debian/libbliss-dev.docs
@@ -0,0 +1 @@
+html