Pajek - History


December 27, 2000 Pajek 0.62: Additional transformations of a vector (logarithm, exponential and power) implemented.
December 25, 2000 Transforming vector to partition by selecting first threshold and step implemented.
December 24, 2000 Transforming two vectors containing polar coordinates (radious and angle in degrees) to vectors containing cartesian coordinates (x and y) and vice versa implemented.
December 22, 2000 Fitting two vectors using linear regression implemented.
December 19, 2000 Moving vertices on the circle with radious defined by the distance from the center implemented (Move/Fix/Radious).
December 13, 2000 Saving currently loaded objects as a Pajek compound file implemented.
December 11, 2000 Reading Pajek compound files (files containing all possible Pajek objects - networks, partitions, permutations, clusters, hierarchies and vectors) implemented.
Example compound file - test.paj
December 7, 2000 Minor changes when editing network.
December 6, 2000 Pajek 0.61: Changes when reporting results in text form to Report window - new lines are appended.
December 4, 2000 Determining k-neighbours of all vertices in cluster added.
December 3, 2000 Computing maximum flow among vertices in cluster added.
December 1, 2000 Options for generating circular layouts in Draw window added.
November 30, 2000 Transforming bidirected arcs to edges generalized.
November 29, 2000 Generating bipartite pgraphs implemented.
November 27, 2000 Intersection of two partitions added.
November 26, 2000 Adding sibling edges included (edges among vertices with common ancestor/descendant).
November 22, 2000 Pajek 0.60: Standard deviation included to Info/Vector.
November 15, 2000 In default shapes.cfg file x_fact changed from 3 to 1 (circles and squares instead of ellipses and rectangles when exporting to EPS and SVG).
November 11, 2000 Computing Cramer's V coefficient between two partitions implemented.
November 10, 2000 Small change in transforming hierarchy to network: nodes in hierarchy (classes) get sign + before their labels.
November 7, 2000 When drawing using vector values: size (instead of diameter) of the vertex represents vector value.
November 3, 2000 Export to SVG using partitions generalized - possibility of using two partitions selected by Partitions menu - first for classes, second for colors.
November 2, 2000 Additional option for exporting to SVG using partition: lines among classes are drawn as semi-lines.
October 28, 2000 Exports to EPS, SVG, VRML and Mage extended to enable marking vertices using vector values.
October 25, 2000 Pajek 0.59: Instead of searching All Paths between two vertices searching for Walks with Limited Length implemented.
October 21, 2000 Possibility of marking vertices using vector values added (see: Options/ MarkVerticesUsing/ VectorValues and Option/ Layout/ DecimalPlaces in Draw window).
October 19, 2000 Info/Partition modified and extended - relative frequencies and cumulatives added.
October 16, 2000 New option in transforming 2-mode to 1-mode networks: generating multiple lines with labels equal to vertices that served to induce them.
October 15, 2000 Computing Spearman rank correlation coefficient between two partitions implemented.
October 14, 2000 Computing Pearson correlation coefficient between two vectors implemented.
October 13, 2000 Vertices belonging to exactly one bicomponent as additional result of computing biconnected components added.
October 12, 2000 When generating any random network vertices are positioned equidistantly on the circle now.
September 28, 2000 Pajek 0.58: Network centralization indices (degree, closeness, betweenness) added.
September 12, 2000 Betweenness centrality algorithm implemented.
September 8, 2000 Closeness centrality algorithm implemented.
September 6, 2000 Pajek 0.57: Exports to SVG format using partition implemented.
August 20, 2000 Export to Scalable Vector Graphics (SVG) format implemented.
You need SVG viewer to watch it using Web browser. A free copy of the plugin for Netscape/Explorer can be downloaded from http://www.adobe.com/svg/viewer/install/
The picture in SVG can be further edited using Jasc Trajectory Pro
August 11, 2000 Extended model for generating random networks implemented. See: R. Albert and A.-L. Barabasi: Topology of evolving networks: local events and universality.
August 5, 2000 Options for showing/hiding vertices of size 0 and lines attached to such vertices added.
August 2, 2000 Generating random network with specified number of arcs implemented.
July 12, 2000 Modifications of export to EPS procedure - size of vertices set in draw window (Options/Size/of Vertices) is taking into account when producing EPS picture.
July 11, 2000 Manual moving of vertices in Draw window improved to take different shapes of vertices into account.
July 5, 2000 Pajek 0.56: Algorithm for finding important vertices in 2-mode network implemented.
July 3, 2000 Algorithm for finding hubs and authorities in directed network implemented (contributed by Matjaž Zaveršnik).
June 27, 2000 Options/Mark Vertices using/Real sizes in Draw window generalized.
June 19-24, 2000 Application of Pajek presented at 15th MATH/CHEM/COMP Conference on the Interfaces among Mathematics, Chemistry and Computer Sciences, Dubrovnik, Croatia
May 25, 2000 Loading and saving Pajek ini files added (Options/Ini File). Using ini file(s) the same default parameters can be restored later.
May 10, 2000 Pajek 0.55: Options/Previous/Next and Generate in Time modified to take vectors into account.
May 5, 2000 Exports to EPS, Mage and VRML modified to include sizes of vertices determined by selected vector.
April 30, 2000 Draw-Vector and Draw-Partition-Vector added: sizes of vertices are determined by selected vector.
April 27-29, 2000 Pajek presented at 17th Leoben-Ljubljana Seminar on Discrete Mathematics, Leoben, Austria
April 23, 2000 Options/Layout/Arrows in the Middle for drawing arrows in the middle of lines added.
April 22, 2000 Deleting multiple lines generalized.
April 19-22, 2000 Pajek presented at DSI 2000, Portorož, Slovenia.
April 13-16, 2000 Pajek presented at Sunbelt XX Conference on Social Networks, Vancouver, Canada
April 11, 2000 Events AP, DP and EP added to the list of time events.
April 10, 2000 Event PE (Pair of arcs to Edge) added to the list of time events.
April 8, 2000 Articulation points as additional result of computing biconnected components added.
April 1, 2000 Saving time network in time events format implemented (File/Time Events Network/Save).
March 15, 2000 Pajek 0.54: Reading time network in time events format implemented (File/Time Events Network/Read).
March 1, 2000 Expanding given partial partition (some class numbers are 0) as 'influence' to the rest of the vertices added.
February 22, 2000 Possibility to save several vectors (determined by cluster) on the same file added.
February 20, 2000 Counting vertices of selected color in the neighbourhood implemented.
February 12, 2000 Changes in searching labeled fragments - labels are classes (colors) in partition now.
February 3, 2000 Pajek 0.53: Number of loops and density of lines in network added to Info/Network/General.
January 28, 2000 Option Previous/Next generalized - possibility to show several networks using the same partition, several partitions on the same network or change network and partition at the same time.
January 27, 2000 Exporting matrix to EPS using permutation modified to enable dividing classes defined by partition using blue lines.
January 26, 2000 Pajek 0.52: Pajek presented at Sredin Seminar, Ljubljana, Slovenia.
January 23, 2000 Exporting layout to Windows bitmap format (bmp) implemented.
January 20, 2000 Relocation algorithm for partitioning signed graphs generalized to report all optimal solutions found.
January 15, 2000 Startup logfile (Pajek.log) introduced. This logfile is automatically executed every time when Pajek is run.
January 12, 2000 Exporting matrices to EPS extended to enable marking cells with negative values (red).
January 6, 2000 Relocation algorithm for partitioning signed graphs included. For more information see: Doreian P., Mrvar A. (1996): A Partitioning Approach to Structural Balance. Social Networks (18). 149-168.
December 28, 1999 Pajek 0.51: CPM procedure modified - implementation without adding source and sink.
December 21, 1999 Changes in implementation of Citation weights procedure.
December 9, 1999 Number of lines having value 1 added in Info/Network/General.
December 6, 1999 Problems with non-visibility of labels in EPS default window fixed.
December 3, 1999 Additional result (free delay times of activities) added in CPM procedure.
November 30, 1999 Possibility of marking lines with their values added.
November 24, 1999 Pajek 0.50: Additional vectors as result of reading GEDCOM files added.
November 4, 1999 Sorting lines around vertices implemented.
October 13, 1999 Pajek presented at conference: Information Society 1999, Ljubljana, Slovenia.
October 8-10, 1999 Pajek presented at Fourth Meeting of Austrian, Slovenian, Italian and Hungarian Young Statisticians, Pecs, Hungary.
October 6, 1999 Pajek 0.49: Some minor bugs fixed.
October 2, 1999 Counter of layouts when drawing sequence of layouts added.
September 30, 1999 Additional measure of dissimilarities among selected vertices added.
September 27, 1999 Selection of border colors in EPS matrix added (only black, or black and white).
September 25, 1999 Exporting matrix to EPS using partition generalized: besides structural also delta densities are added (which are more suitable for sparse networks)
September 20-22, 1999 Pajek presented at International Conference on Methodology and Statistics, Preddvor, Slovenia.
September 15 - 19, 1999 Application of Pajek presented at Graph Drawing 1999 Conference, Prague, Czeck Republic.
September 9, 1999 Subdividing lines using middle mouse button in Edit-Network implemented.
September 8, 1999 Pajek 0.48: Removing lines with value lower/higher than specified value implemented.
September 3, 1999 Transforming 2-mode (affiliation) network to ordinary 1-mode network implemented.
August 30, 1999 Reading and saving 2-mode (affiliation) networks added. The input/output file can be in Pajek or Ucinet format (e.g. Davis.dat from Ucinet dataset).
August 27, 1999 Pajek 0.47: No explicit tests have been done on version 0.47 of Pajek to see if it is Year 2000 compliant, but to the best of our belief no problems will arise. Pajek does not offer date-manipulation features to the user in any form. Dates in output files are displayed in Delphi's LongDateFormat (e. g. 08-27-2001).
August 26, 1999 Minor changes in triadic census algorithm to speed it up and standard coding of triads added.
August 23, 1999 Exporting matrix to EPS using partition implemented: Density of lines among classes and vertices in selected two classes are shown using shadowing.
August 14, 1999 Reading Ucinet DL files changed. If the file contains several matrices, all of them use the same description of vertices (like coordinates) - useful when displaying sequence of networks.
August 12, 1999 Generating network in specified time(s): Option for generating new network only if at least one vertex or line changed in the period.
August 10, 1999 Possibility to include each vertex to its own neighbourhood when computing dissimilarity matrices added. Dissimilarity d1 normalized using maxdegrees.
August 6, 1999 Possibility to display and optimize sequence of networks implemented. Menu: Options/Previous/Next for changing parameters when drawing sequence of (previous/next) networks added in Draw window.
August 5, 1999 Exporting colors of vertices and lines defined on input (NET file) to Mage and VRML added.
August 1, 1999 Possibility to use colors of vertices and lines defined on input (NET file) in draw window added (Options/Colors/Vertices, Edges or Arcs). List of all possible colors (Acrobat file).
Example NET file with different colors of vertices and arcs.
July 31, 1999 Number of different colors when using Draw/Partition increased to 32. See: Class numbers and colors (Acrobat file).
July 28, 1999 Export to Mage generalized - exporting consequent networks (and partitions).
July 26, 1999 Minor changes in viewing partition, permutation, cluster and vector (vertex labels from network attached).
July 25, 1999 Generating network in specified time(s) implemented (Net/Transform/Generate in Time).
July 23, 1999 Displaying Next/Previous network in memory implemented (in Draw window).
July 21, 1999 Pajek 0.46: Editing cluster implemented.
July 21, 1999 Pajek presented at Sredin Seminar, Ljubljana, Slovenia.
July 15, 1999 Creating empty cluster implemented.
July 11, 1999 Exporting network as matrix in EPS using permutation implemented.
July 8, 1999 Editing permutation implemented.
July 5, 1999 Different measures of dissimilarities among selected vertices determined using cluster according to common neighbours added.
June 28 - July 2, 1999 Application of Pajek presented at 4th Slovenian International Conference in Graph Theory, Bled, Slovenia
June 27, 1999 Median and standard deviation included to Info/Partition.
June 21-26, 1999 Application of Pajek presented at 14th MATH/CHEM/COMP Conference on the Interfaces among Mathematics, Chemistry and Computer Sciences, Dubrovnik, Croatia
June 2, 1999 Pajek 0.45: Possibility of selecting noncontiguous ranges in partition implemented (Cluster/Binarize Partition).
May 25, 1999 Pajek 0.44: Extended Info/Partition.
May 14, 1999 Faster algorithms for weak and strong components implemented.
May 12, 1999 Pajek 0.43: Upper number of vertices increased to 999997.
May 11, 1999 Pajek presented at Seminar for Discrete Mathematics, Faculty of Mathematics and Physics, Ljubljana, Slovenia.
May 4, 1999 Pajek 0.42: Valued core partition implemented.
April 28, 1999 Generating identity vector of selected dimension added.
April 21-24, 1999 Pajek presented at DSI'99, Portorož, Slovenia.
March 10, 1999 Pajek 0.41: Triadic Census (counting triads) implemented.
March 5, 1999 Autosaving position and size of Info window implemented.
February 18-21, 1999 Pajek presented at Sunbelt XIX Conference on Social Networks, Charleston, USA
February 8, 1999 Pajek 0.40: Modified exports to VRML, Kinemages and MDLMolfile according to visibility / nonvisibility of edges and arcs.
February 2, 1999 Modified Centers procedure (result of the procedure is vector now).
January 12, 1999 Some minor bugs fixed.
January 2, 1999 Pajek 0.39: Harmonic function (defined on vector, network, partition and permutation) implemented.
January 1, 1999 Multiplication of matrix (network) by vector implemented.
December 23, 1998 Several minor bugs fixed.
December 15, 1998 Pajek 0.38: Export to Kinemages generalized - possibility of using two partitions selected by Partitions menu - first for generations, second for colors.
December 1, 1998 Pajek 0.37: Move/Grasp added when drawing using partition - determine which additional vertices are moving when clicking with left mouse button close to vertex in given class (only selected, selected and higher, selected and lower).
November 18, 1998 Some bugs in shrinking procedure fixed.
October 21, 1998 Pajek 0.36: Possibility to have more than one vector in input file added.
October 18, 1998 Editing vector implemented.
October 15, 1998 Some smaller bugs fixed.
October 13, 1998 Pajek 0.35: Retrieving coordinates of network to vector implemented. Putting vector as coordinates of network implemented.
October 9-11, 1998 Pajek presented at Austrian, Hungarian, and Slovenian Joint Meeting of Young Statisticians, Piran, Slovenia.
October 8, 1998 Truncating vector and transforming vector to partition by truncating implemented.
October 7, 1998 Pajek 0.34: Binary operations on vectors (sum, difference, product, division, min, max) implemented and additional operations according to neighbours added.
October 6, 1998 Reordering vector and specifying results when dividing by 0 in Options/Read/Write added.
October 5, 1998 Making vector from partition and vector transformations (multiplying by a constant, absolute, sqrt, normalizations) implemented.
October 4, 1998 Mirroring permutation and making partition into selected number of clusters from given permutation implemented.
October 3, 1998 Another option of exporting to Kinemages added - kinamages with labels.
October 1, 1998 Leader partition - partitioning vertices of acycling network inside layers implemented.
September 27, 1998 Procedure making partition from vector generalized.
September 25, 1998 Making permutation from vector implemented.
September 24, 1998 Random partition into given number of clusters implemented.
September 23, 1998 Pajek presented at Sredin Seminar, Ljubljana, Slovenia.
September 21, 1998 Pajek 0.33: Modified CPM and Citation weights procedures (results of the procedures are vectors now).
September 19, 1998 Relinking index of genealogy added to Info/Indices.
September 17, 1998 Export to Kinemages format improved to support animation.
September 15, 1998 Exporting network as matrix in EPS implemented (File/Network/Export Matrix to EPS). If valued network is exported shadowing is used.
September 14, 1998 Averaging class numbers of neighbours and information about vector implemented.
September 13, 1998 Extracting subvector according to partition and making partition from vector implemented.
September 12, 1998 Vector (*.vec) as a new object in Pajek added. Input format is similar to partitions, only that values can be real numbers (not only positive integers).
September 10-11, 1998 Pajek presented at Graph Drawing Workshop, Passau, Germany.
September 7-9, 1998 Pajek presented at International Conference on Methodology and Statistics, Preddvor, Slovenia.
September 4, 1998 Removing all lines inside the cluster implemented.
September 2, 1998 Pajek presented at Sredin Seminar, Ljubljana, Slovenia.
August 31, 1998 Pajek 0.32: Making partition from hierarchy and expanding partition according to another partition implemented.
August 30, 1998 Modification of making network from hierarchy and extracting cluster from hierarchy done.
August 28, 1998 Symmetric-Acyclic decomposition of network implemented.
August 24, 1998 Pajek 0.31: Computing aesthetic properties of a given layout implemented (number of crossings, closest vertices,...)
August 20, 1998 Modified shrink procedure, possibility of drawing/hiding lines of network, and possibility of selecting maximum number of vertices in network that will still be drawn implemented.
August 10, 1998 Export to Kinemages format implemented. You need Mage viewer to watch it. A free copy of the Mage software can be downloaded from Download Mage)
July 27-31, 1998 Pajek presented at Dagstuhl Seminar, Germany - Graph Algorithms and Applications.
July 22, 1998 Reflection around y axis added.
July 21, 1998 Test if network is acyclic added to genealogy depth partition.
June 22-27, 1998 Pajek presented at 13th MATH/CHEM/COMP Conference on the Interfaces among Mathematics, Chemistry and Computer Sciences, Dubrovnik, Croatia
May 31, 1998 Pajek presented at Sunbelt XVIII and 5th European Conference on Social Networks, Sitges, Spain
May 27, 1998 Workshop on Pajek at Sunbelt XVIII and 5th European Conference on Social Networks, Sitges, Spain
May 24, 1998 Pajek 0.30: Some bugs fixed and new macros added.
May 11, 1998 Pajek 0.29: Possibility of marking lines added.
May 7, 1998 Pajek presented at DSI'98, Portorož, Slovenia.
April 29, 1998 Hierarchy as additional result of searching fragments added.
April 15, 1998 Pajek 0.28: Export to MDL MOLfile implemented. This kind of files can be examined using Netscape plugin Chime (Chemscape Chime).
April 13, 1998 Reading MDL MOLfiles (*.mol) implemented (often used in molecular graphics).
April 12, 1998 Generating random network having fixed input or output degrees of vertices implemented.
April 8, 1998 Pajek 0.27: Export to VRML improved to fit better in CosmoPlayer.
March 28, 1998 Pajek 0.26: Drawing vertices using real sizes of vertices implemented.
March 27, 1998 Storing additional settings (Colors and Sizes) in Draw window implemented.
March 25, 1998 Pajek 0.25: Improved version of optimisation 2D layers implemented.
March 17, 1998 Pajek 0.24: Extracting selected class(es) to GEDCOM file implemented.
March 4, 1998 Pajek 0.23: Pajek presented at Sredin Seminar, Ljubljana, Slovenia.
March 3, 1998 Generalised and faster version of biconnected components implemented.
February 26, 1998 Improved version of genealogy depth partition implemented.
February 19, 1998 New option (forget values of lines) in CPM algorithm added.
February 12, 1998 Pajek presented at Enajsto posvetovanje sekcije za raziskovanje informacijskih sistemov, Ljubljana, Slovenia.
January 27, 1998 Box and Diamond as additional default shapes in DRAW/Export/Options included.
January 21, 1998 Additional default EPS options in DRAW/Export/Options included (Colors must begin with capital letter!).
January 18, 1998 Converting all arcs in both directions to edges implemented.
January 17, 1998 Modification of reading/saving windows done.
January 16, 1998 Determining coordinates of vertices in original network according to coordinates of vertices in shrunk network implemented.
January 12, 1998 Possibility of displaying selected labels determined by the partition using Options/Mark vertices using/Selected Class implemented
January 10, 1998 Pajek signature on EPS files added, triangle and double edge shapes implemented.
January 7, 1998 New algorithms for 2D an 3D drawing by layers added.
January, 4, 1998 Autosaving working directories added.
December 27, 1997 Generalisation of searching fragments implemented.
December 16, 1997 Pgraph (D. R. White) genealogy format and drawing dotted lines (p Dots) implemented.
December 14, 1997 Info of hierarchy implemented.
December 10, 1997 UCINET (DL) input and output format added.
December 5, 1997 Minimization of total length of lines in drawing by layers implemented (relocation algorithm).
November 30, 1997 Genealogy depth partition implemented.
November 28, 1997 Possibility of typing only the beginning of vertex labels (some first characters) and then selecting from the list of hits implemented (when searching k-neighbours or paths, editing network).
November 26, 1997 Pajek 0.15: Pajek presented at Sredin Seminar, Ljubljana, Slovenia
November 25, 1997 Drawing in layers in z direction implemented.
November 23, 1997 Draw/Option/ScrollBar implemented (Moving across the picture of network when one part of the picture is selected. Spinning picture when whole picture is selected - like pressing keys X,Y,Z,S or x,y,z,s [opposite direction]).
November 22, 1997 Depth and breadth first numbering (permutation) implemented.
November 20, 1997 Addition of partitions implemented.
November 17, 1997 Pajek 0.14: Macro execution implemented.
November 12, 1997 Operations on two partitions and reordering of partition implemented.
November 1, 1997 Editing Clustering implemented.
October 31, 1997 Exporting to EPS/PS using WYSIWYG option implemented (What You See Is What You Get - exported EPS picture is similar to picture in Draw window)
October 30, 1997 Single right mouse click on selected vertex in Draw window brings you to Edit window, where you can edit lines that belong to selected vertex: delete line [double left mouse click on selected line], add line [double left mouse click on Newline] or change value of selected line [single right mouse click].
October 27, 1997 Additional results in shortest paths and maximum flow algorithms implemented.
October 25, 1997 Removing all arcs/edges implemented.
October 18, 1997 Reading GEDCOM (genealogy) format and shapes partition implemented.
October 18, 1997 Pajek presented at Second Austrian Slovene Joint Statistics Meeting of Young Statisticians, Pliberk (Bleiburg), Austria.
October 16, 1997 Autosaving position and size of Main and Draw window implemented.
September 15-17, 1997 Pajek presented at International Conference od Applied Statistics, Preddvor, Slovenia.
September 5, 1997 Refinement of partition according to network (reachability) and transforming partition to its canonical form implemented
August 30, 1997 Values of lines considered as similarities/dissimilarities when computing eigenvectors (or consider all values as 1)
August 22, 1997 Possibility to input constraints for feasible positions when moving vertices by hand in Draw window implemented.
August 17, 1997 Conversion of hierarchy into network implemented
August 15, 1997 Simple version of execution of Petri net implemented
July 28, 1997 Searching diameter (longest shortest path) of network included
July 19, 1997 Modification of Fruchterman-Reingold algorithm
July 9, 1997 Pajek presented at Sredin Seminar, Ljubljana, Slovenia
July 8, 1997 Additional statistics of partitions (Info/Partition) implemented
July 5, 1997 Obtaining layout(s) using eigenvalues/eigenvectors (Lanczos algorithm) implemented (first implementation done by Bor Plestenjak)
June 23-28, 1997 Pajek presented at 12th MATH/CHEM/COMP Conference on the Interfaces among Mathematics, Chemistry and Computer Sciences, Dubrovnik, Croatia
June 15, 1997 Reduction of flow graphs, searching fragments (in moleculae or graphs)
June 7, 1997 Ball and stick input and output format and MacMol output format added (often used in molecular graphics)
June 1, 1997 Storing in matrix form, generalized binary operations and multiple zoom implemented
May 14, 1997 Fisheye transformation and binary operations on networks implemented
May 7, 1997 Procedure identify added - reorder and/or fuse vertices from partition
April 30, 1997 Fruchterman-Reingold algorithm for automatic layout generation in space implemented
April 24-25, 1997 Pajek presented at 15th Leoben-Ljubljana Seminar on Combinatorics, Leoben, Austria
April 23, 1997 Spin in space, export to VRML
April 20, 1997 Modification of EPS format (importing pictures to Word for Windows)
April 16, 1997 Pajek 0.3: Centers, Spin in plane
April 10, 1997 Pajek presented at DSI'97, Portorož, Slovenia
April 2, 1997 Pajek 0.2: Export to EPS/PS implemented
March 19, 1997     Line values used in Energy drawing algorithm
February 13-16, 1997 Pajek presented at XVII Sunbelt Conference in San Diego, USA
January 29, 1997 Pajek presented at Sredin Seminar, Ljubljana, Slovenia
January 15, 1997 Pajek 0.1: Visual presentation and Energy drawing (Kamada-Kawai) added
December 22, 1996 First version of program - implementation of basic algorithms
November 15, 1996 First ideas about large network analysis program

Pajek Manual; Macros