This is an automated email from the ASF dual-hosted git repository.
erans pushed a change to branch master
in repository https://gitbox.apache.org/repos/asf/commons-graph.git.
at 86481d7 SANDBOX-349: Verify Prim's and Kruskal's algorithms
correctness - applying Rogério Theodoro de Brito's first three patches
This branch includes the following new commits:
new a02a662 first checkin of commons-graph mvn2 pom
new db9111d directory layout switched to default mvn2 layout
new 261e19e removed old obsolete build files
new 78a5579 first checkin of Graph site descriptor
new d492f08 removed obsolete mvn1 site descriptor
new cface0b first checkin of assembly descriptors
new 4703e4b first checkin of release notes descriptor
new 221d172 first checkin of Graph DOAP descriptor
new 4d18901 upgrading copyright year in the header
new 8bd4d64 added Vertex interface description, kindly borrowed from
Wikipedia
new b8b7acd upgrading copyright year in the header
new b1f23ca added Edge interface description, kindly borrowed from
Wikipedia
new 32442a9 'double' as a weight is too restrictive, using Java5 Generics
is possible to allow users define their own type number as a weight
new 8b3148e added WeightedEdge interface description, kindly borrowed
from Wikipedia
new 673aa3d added missing @return statement in javadoc
new b695e29 minor format
new a952183 added missing jdepend dependency (it causes compilation
problems)
new b65fad4 temporary fix for compile error - whole implementation needs
to be reviewed
new 05eb6bc fixed copyright years
new 98bae4b fixed Graph description in javadoc
new b4c9cfe removed redundant 'public' modifier
new 635d523 typing Vertices/Edges of a graph would simplify users
understanding which kind of data the Graph stores
new 45003df minor format
new 27e0d25 fixed javadoc violations
new 38f6ed4 fixed broken return types
new 5bf5112 minor format
new 6efee85 fixed copyright years
new ffcdb9d added missing V,E parameter types description
new 1d1489e fixed UndirectedGraph description, kindly borrowed from
Wikipedia
new 5a7bc6c added missing <Vertex,Edge> generics types
new d40beed minor format
new 6635787 fixed copyright years
new fb52b3f fixed DirectedGraph description, kindly borrowed from
Wikipedia
new 53c9c3f removed redundant 'public' modifier on interface methods
new 27362bd minor code format
new 0a62737 added missing <Vertex,Edge> generics types
new 38bcd62 minor code format
new ca316ac added missing generics on (in|out)bound methods
new 967b9be fixed javadoc descriptions
new 3f9bde0 added generics types to weighted graph definition
new 37ece63 minor format
new 225e3df weighted graph is composed by weighted edges
new 081a97c fixed WeightedGraph interface description
new d6e5d0a completed getWeight() method javadoc
new 9a1d3b2 fixed ASL2.0 header, added where missing
new 9f7a54a added missing javadoc
new 928aeb9 fixed Path description, kindly borrowed from Wikipedia
new 83ab2e6 minor format
new 4d8c91c fixed Vertex/Edge types on returned collections
new d36ef8d removed redundand 'public' modifier in Path interface
new b8a2fac fixed MutableGraph description
new 38028d9 added links on javadoc description
new 46867fb removed redundand 'public' modifier in interface
new 9a110aa fixed Vertex,Edge Generics types
new 75171e2 minor code format
new fdfbab0 minor code format
new 880dd84 organized imports
new ebbeafe fixed javadocs description
new b800512 fixed Vertex,Edge Generics types
new 64c2884 minor code format
new 7b0d6a5 organized imports
new f2516c2 fixed javadoc comments
new 237b121 fixed MutableDirectedGraph interface description
new 8d39ad3 added generated serialVersionUID
new 5d18e98 reorganizing basic exception according to latest
RuntimeException APIs
new 408b477 minor code format
new 1a4e7f7 minor code format
new c8ff51f fixed javadoc comments
new db4da1c added constructor with the specified detail message and cause
new e737006 basic GraphException moved in the main APIs package
new d401326 added missing javadoc
new 2b8c8a9 removed redundand 'public' modifier in interface
new 569a20e minor code format
new b367624 WeightedEdge implementations have to be comparable
new 4fa1ed9 first checkin of main package descriptor
new e8dd5c1 Fixed Vertex/Edge type in methods signature
new a9e50c9 no need to have homogeneous weights in the graph; some edges
can have weight Double, some Integer and so on...
new cf4d472 fixed UndirectedGraphImpl generics types
new e7de82c internal UndirectedGraphImpl collections can be final
new 2154f4d minor code format
new 6955836 organized imports
new 35fe4b7 removed useless empty constructor
new 2ed7bb9 returned set have to be read-only data structures
new 16da104 removed unnecessary 'else' clause
new 7c4ea7b fixing javadocs
new 24b0b4d removed redundant 'public' modifieer on interface methods
new a8793de minor format
new be9a7d3 weight is a generic Number, not just fixed/forced double
new 4df50d1 minor format
new 567a9c0 fixed Javadoc
new 3add4c3 fixed wrong Generics usage
new aef76a7 added/fixed Generics types usage
new 2fdb1c9 organized imports
new 9c355f8 returned collections are read-only data structures
new 5b74938 added missing Generics types
new e40672f clause moved outside 'else' statements when unneeded
new 043ab91 minor code format
new 646c6ee internal collections can be final
new 7a50991 root vertex is of generic type V
new 8ebaea3 minor code format
new bad78ce fixing javadoc comments...
new 284de4b generified Vertex/Edge types
new d302e29 organized imports
new 396d6ff removed redundant 'public' modifier
new 9c78b28 minor code format
new 60e86a4 generified Vertex/Edge in Contract interface
new 8d60f94 added generics types
new 480f121 wrapped graph should be final
new 1386ee0 minor code format
new b892692 throw an IllegalArgumentException when passed a null wrapped
graph
new 9f805cc a GraphWrapper must behave like a Graph
new 04f0044 fixed generics type removed useless constructor/setter
new a207afb fixed methods Javadoc
new 472cb1f minor code format
new 9d82723 wrapped graph can be final
new 9bc893c generified Vertex/Edge
new 43c00fe internal collection can be final
new 2b6af72 minor code format
new 779360b removed unneeded 'else' statement
new df26e3e fixed javadoc comments
new d995575 first checkin of domain.basic package descriptor
new f6399e9 started adding generics for Vertex/Edge
new 2c49e4e organized imports
new 0096c2d minor code format
new 5d7d0fb removed useless 'else' statements
new 8e330ea fields made final, where possible
new 3e849f4 reorganized stuff, static fields/methods first
new f77a0da variable must not start with uppercase char
new 10e2fd8 variable must not start with uppercase char
new a9d2a9d static fields have to be upper-case
new 5d58127 fixed DECORATED_GRAPHS cache type suppressed warnings where
possible
new 11a1873 decorated graph class name made esplicit, name that contain
achronyms are not intuitive
new 94d9a62 first checkin of decorator package
new 900a0fa Named interface renamed to Labeled, see
http://mathworld.wolfram.com/LabeledGraph.html
new 84d7fa8 fixed labeled javadoc method
new 942bb18 removed duplicated package, see o.a.c.graph.algorithm.seach
new 72180dd fixed Labeled javadoc description
new f3abe58 by definition, an edge is the link that connect a pair of
vertices
new 3fb2eac updated Edge typing, given the current Edge definition
new 17bea6b edge's weight is defined in the WeightedEdge itself, graph
doesn't need to expose an API to calculate it
new ab7badc edge's head/tail are defined in the Edge itself, graph
doesn't need to expose an API to calculate them
new b92b6b1 presumablly, vertex/edge are homogeneous in a graph
new a6040cc fixed javadoc param description
new c13085c first checkin of labeled graph element
new 1ac4759 first checkin of a clean implementation of
(Breadth|Depth)-first search algorithms
new 39c60e3 added missing javadoc
new ff12173 handled potential NPEs
new d146ca2 added overloaded search methods without any handler APIs
still need to be well defined, maybe the default methods can return the visit
list
new aa4b55e first checkin of BaseGraphVisitHanlder class
new 5a923a9 fixed typo on class name
new 4acd8ce started separating old existing components in submodules;
visualizer code moved to the proper module
new 2a17edc separated statemachine codebase to a proper module (not
included in the reactor yet)
new c0d4b87 separated jdepend codebase to a proper module (not included
in the reactor yet)
new 1020cd2 separated dependency codebase to a proper module (not
included in the reactor yet)
new 71cd125 dependency test moved to the proper submodule
new 2405cbf dropped Factory & Proxy implementations, it was too
prototypal to continue following the development
new d0f67b7 o.a.c.g.algorithm.search replaced by o.a.c.g.visit package
new 9ddeec5 fixed compilation problems
new 6e52abb looks like Number is a little limited, so Double is nice (for
now)
new fb4a9a4 first checkin of a prototypal version of Dijkstra's shortest
path algorithm TODO return a Path implementation
new 420b201 removed unused exception, see o.a.c.g.shortestpath package
new b252e52 first checkin of shortest path package descriptor
new 89b3c28 WeightedPath is composed by WeightedEdges
new 294fa80 start/end renamed to source/target, since such terms are used
more often in literature
new b4b44c5 first checkin of InMemoryPath class, an in-memory
representation of WeightedPath
new 660340d Path rebuilt traversing bottom-up the predecessors map (it
stores Edges so it makes it easier building both Vertices/Edges lists)
new 3ce0596 even if source/target should be part of the Vertices set,
better using the equals() operator instead of the reference comparison (immane
a scenario where nodes are retrieved from a remote JVM...)
new a1ec5aa path package replaced by new shortestpath one
new cc96f65 removed unneeded Path impl, the new one is more verastile
new 4382781 even if source/target should be part of the Vertices set,
better using the equals() operator instead of the reference comparison (imagine
a scenario where nodes are retrieved from a remote JVM...)
new f68b2a9 when/if building the path, the V vertex is already the
target, started rebuilding the path from it
new 008bf56 put expected value first, when asserting vertices equality
new 3a03aca Edge is already a pair of Vertices, there's no need of
connecting
new a72b294 GraphException is a Runtime exception, removed from signatures
new 253c746 simplified ShortesDistance design; it maintains Vertices
distances and is able to determine which Vertex has the shortest distance
between 2 Vertices
new 6025dac used proper Double wrapper comparator method for comparing
values
new 77cb26b InMemoryPath moved to a proper package that will contains
memory-based data structures implementations
new 9b33f59 first checkin of model package descriptor
new 38c60db removed non-existing anymore parameter
new 88a98af first checkin of BaseGraph, an abstract memory-based Graph
representation in-memory based implementation can be inherit from this class
new 052a5e1 added internal utility method to check if Vertices in the
given Edge are present in the Graph
new 04a3bd4 first checkin of BaseMutableGraph (it partially behaves like
a directed Graph since populates the adjacency list) checkEdge() method moved
in the BaseMutableGraph, not needed in the BaseGraph
new b77a00e missed to collect edges in the proper set
new 980e2ac first checkin of DirectedMutableGraph class
new 0f3590e first checkin of DirectedMutableWeightedGraph
new 215d972 old base stuff moved outside main src due to refactoring (and
finally having a working /trunk)
new 5b0e136 moved old exception package to old src dir
new d0f0de8 dropped old obsolete domain subpackage
new 84c06a5 Prim's algorithms create a spanning tree (forest) added
missing javadoc
new ba892e2 first checkin of Minimum spanning tree algorithms package
descriptor
new c8e3c2c added Kruskal and Boruvka empty skeletons
new 137321c no very intuitive, set explicitly
new 1b7411e fixed method interception added missing javadoc
new 71f65ec first checkin of mock Vertex/Edge for testing purposes
new 84c64f4 no needs to depend from the concrete implementation for
LabeledVertex
new 5764fb6 implemented equals/hashCode methods
new dd6caf3 implemented equals/hashCode methods
new f76d990 removed unneeded dependencies
new 7898fac upgrated junit version
new 9c31dc0 even if graph is not on jira, its id should be GRAPH, not
DIGESTER (copied from it)
new 9624d18 ignoring unchecked warnings, etherogeneous edges won't be
tested (ATM)
new baa28dd no needs to have Generics in test cases
new 653f8a3 first checkin of BaseLabeledWeightedEdge class
new f423d07 changed constructor signature, read "edge X from vertex V1 to
V2 with weight W"
new 34d3c01 added toString method implementation
new 5188925 DirectedMutableWeightedGraph can't be Weighted if it doesn't
implement WeightedGraph
new fef6cd9 overriden toString() method
new 428e104 fixed all toString() representations
new 7bceb71 no needs to get the label when representing vertices in edges
new 0ce032e improved toString() representation
new 6e2038d added source node distance initialization to 0 fixed node
distance calculus
new cb3ade6 added vertices in the toString() representation
new e3162f1 added missing vertices in the toString() representation
new b5738c5 added hashCode (useless?!?) and equals (needed at least in
tests) methods implementation
new a7760c8 first checkin of successful Dijkstra's algorithm test case
new 8502aa6 removed useless assertion verification, see line 106
new 7135b98 graph, not digester :P
new fb4963e used getters to build the toString() representation (due to
proxy adapters)
new 4326fb7 used getters in equals() method
new afd5f2c checked ctor arguments are not null
new 599ca1f 'end' vertex renamed to 'target'
new 0955b43 InMemoryPath made non final - it has to be split between
path/weightedPath
new 5e67a36 splitted Path/WeightedPath implementations
new 1f5de75 Dijkstra's implementation needs to use the WeightedPath
implementation
new a7f64e0 discriminated vertix edges depending on the fact if graph is
(un)directed
new 7bb76a7 added missing javadoc
new de8ecd2 suppressed unchecked warnings in equal() implementations
new 5e09687 first checkin of utilities package
new 00a1d2b discriminated ingoing/outgoing edges in directed graph,
adjacency list used to store all edges
new 75b017b discriminated which are connected vertices in edges, avoid to
assuming facts that can be violated
new a40461e first checkin of UndirectedMutableGraph class
new 9487083 first checkin of UnirectedMutableWeightedGraph class
new 72faafb removed prototypal useless class
new 15b75b6 removed useless interfaces composition
new 223402a typo on classname
new 8f04e6a Dijkstra's algorithm tested on both (un)directed graphs
new 932f6b2 discriminated which are connected vertices in edges, avoid to
assuming facts that can be violated
new 8655767 breadth/depth search by default return a covering tree
new 6c80679 fixed wrong logic on marking edges visited: if they can be
added, they weren't already in the set
new 9c39c6c first checkin of VisitGraphBuilder class
new 6c05962 default (breadth|depht)firstSearch algoritms produce now, as
output, the search tree
new aa0abc2 visit methods made static
new 6c6b3f4 fixed wrong node enqueued wne applying breadthFirstSearch
new 557cf0d fixed Queue management policy
new e2e9532 added equals/toString for test purposes
new d049e53 first checkin of visit algorithms tes case class
new 182e332 using LinkedHashSet insertion order will be prevented
new 5663a59 added DepthFirstSearch test case
new aa72f0b Update pom.xml properties for the issue-tracking page &
generate standard commons issue-tracking and mailing-list pages
new 13b06e3 typos in the method description
new fde64eb first checkin of PredecessorsList class, it will be reused by
other shortest path algorithms
new ca402fd used the object adapter pattern to implement the
ShortestDistance in order to expose more intuitive APIs
new c05d01d added missing class description
new f2f8df0 minor format
new cf97ed8 made the InMemoryWeightedPath more flexible and adaptable for
algorithms which don't know the path weight at the end of execution
new 3cd3fad first checkin of Bellman–Ford and Floyd–Warshall algorithms
(empty stubs)
new 2a1f6a0 first checkin of empty stub A* algorithm
new 7e78674 using LinkedHashSet preserves the order which edges are added
new fb3866b minor format
new d71c4fb modified graph according to picture, LinkedHashSet in the
in-memory representation fixed the visit
new 9fccc90 GraphVisitHandlermade non optional
new 56cd25b as reported on wikipedia
(http://en.wikipedia.org/wiki/Bellman-Ford_algorithm) "The Bellman–Ford
algorithm computes single-source shortest paths in a weighted digraph."
new 429e239 as reported on wikipedia
(http://en.wikipedia.org/wiki/Dijkstra%27s_algorithm) "This [Dijkstra] is
asymptotically the fastest known single-source shortest-path algorithm for
arbitrary directed graphs with unbounded nonnegative weights"
new bba5185 used directed only graph in Dijkstra's test
new 93cc158 typos
new 7a241fe first checkin of Heuristic interface, it will be used to
calculate the h(x) function in A* algorithm
new f16f2c1 modified the A* algorithm signature, it accepts the h(x)
instance
new d13c87f no needs to store outbound edges in a temporary variable
new c6a4e12 first checkin of A* algorithm implementation
new 194b280 renamed input arguments according to A* naming conventions
new 93f29b5 no needs to store hScores since they are used just to lookup
values
new 895a68a added missing ASL header
new 2f8dcea fixed broken link, @link is just for classes
new 2341907 properly renamed the graph variable name
new cf696dc stored the hScore value in a tmp variable
new 064c0ee fixed missing source Vertex in the path vertices list
new a922e3a added missing source Vertex in the expected path vertices list
new 589b261 first checkin of working AStarTestCase
new eb65f7f just relocated imports
new a1807f6 minor format
new 4551530 trying to add automagically the inverted Edge in
UndirectedGraph is not successfully, switched back to a more traditional
implementation where bi-directional edges have to be added explicitely
new 102315c removed useless reverse() methods
new 9b05ea0 label, head, tail, weight cannot be null
new b0eb3b3 when adding an Edge, checked that the edge itself, the head
vertex and the tail vertex are not null
new 64c3c82 [SANDBOX-332] add FloydWarshall algorithm implementation -
patch submitted by Marco Speranza
new 2807bff getShortestDistance method doesn't need to be visible outside
the package
new 89a8ee6 stuff under utils package moved in the model package
new 3d69c04 added graph order and size reader methods
new d7cf840 much better exposing Iterable instead of the whole Set of
Vertex/Edge that would fit much better in scenarios where lazyloading is
required because Vertex/Edge come from the network or from a BigData storage...
new 2c4f6ca throws a PathNotFoundException when a path between the input
vertex doesn't exist
new 833e4fc no needs to store the VertexPair instance
new 73f911e first checkin of NegativeWeightedCycleException class
new 9d588b3 avoid to format exception messages outside the exception,
simplified the string format centralizing it in the GraphException
new 4daed7d first (incomplete) implementation of Bellmann-Ford's algorithm
new e5b661c improved error message
new 78b7e51 GraphException accept String.format() pattern/arguments
new fe3580d huge Graph refactory, a big step back to the initial graph
version. current APIs model the Graph in the wrong way, above all because they
suggest users to insert, for Undirected graphs, the same Edge info, twice, and
that's absolutely wrong, according to math definitions. Especially, the
following tense in that article[1] suggests that the current model is wrong:
new d4a0d95 added Marco Speranza in the contributors list
new f9c0205 Edges stored in an hashset, in undirected graphs edges were
enlisted twice
new 90cf75f added missing Vertex (in|out)degree support
new 959b939 no needs to throw an exception for already present edges,
automatically discarded
new 17e04aa [SANDBOX-333] Graph coloring implementation - patch provided
by Marco Speranza
new 24f7edb first cehckin of 'coloring' package descriptor
new c7a9e59 the comparator returns -1 even when the comparable are
equals, easier inverting the compare order
new 55a4fd2 used a data structure to store and maintain the color for
each vertex and the required number of colors for graph coloring.
new f41a30a testcase uses the data structure to store and maintain the
color for each vertex and the required number of colors for graph coloring.
new 3cd125c avoid reload all ordered vertices in a new list, implemented
a lazy-iterator that cycles over the multi-valued TreeMap
new a946514 checkstyle violations: avoid inner assignment
new 2e7648d used proper Queue methods
new 3249c5f used proper Queue methods
new 808c1c7 [SANDBOX-334] Bad coloring for crawn graph - patch submitted
by Marco Speranza
new 7fd6d76 code polishing
new 1559e60 typos in comments
new 4266e29 optimized imports
new d12e9c4 PredecessorsList field members made private, added public
method to check if PredecessorsList is empty
new edc7124 first checkin of BellmannFordTestCase fixed BellmannFord
algorithm (changed also the signature, it is the single source algorithm)
new 27100bb first checkin of DOT language graph exporter
new c0fcf6b fixed Javadoc
new 57d4e14 Path size() method replaced by getOrder()/getSize()
new 8a55a69 just offered iterables on vertices/edges
new ec6f19a trailing space
new f4b8405 [SANDBOX-337] Wrong value for Vertex degree
new 762fdb2 Path implemented as a Graph - it can be rendered by the
Exporters
new 6f261cf added missing target in the path
new 75c68cd added checkstyle suppressions
new 5837a67 added javadoc comment recommendation for implementors
new a888f1b Prim's algorithm requires a source Vertex to be executed
Prim's algorithm returned Graph is a WeightedGraph
new a623f6c ShortestDistances class moved in a shared section since
shortest path/MST algorithms need it
new 5c43fd2 initial skeleton implementation of Prim algorithm
new 5b4631e first checkin of SpanningTree interface
new d23e479 first checkin of MutableSpanningTree class
new 8081a26 [SANDBOX-335] Graph Coloring: Backtracking algorithm - patch
provided by Marco Speranza
new f1990e8 missing from [SANDBOX-335] Graph Coloring: Backtracking
algorithm - patch provided by Marco Speranza
new 7b6463a [SANDBOX-337] Wrong value for Vertex degree - TestCase
submitted by Marco Speranza
new 8a89bff [SANDBOX-336] Duplicate Edge - TestCase submitted by Marco
Speranza
new 69c07a8 fixed Prim's algorithm implementation + TestCase
new c01fa89 ShortestDistances useful only in the 'shortestpath' package
'shared' package not useful, removed
new 8234e01 added graph on Wikipedia page to test Prim's algorithm
new a57a977 added a Prim's algorithm method that select the Vertex source
from the input Graph vertices
new 7567abf fixed javadoc, Prim's doesn't produce a spanning tree (if
nodes are not reachable from the source, they are cut out)
new aca738d added missing source parameter in javadoc
new 9097343 [SANDBOX-338] [Graph Coloring] Generic iterable set of color
- patch submitted by Marco Speranza
new 9066af1 added Kruskal's algorithm implementation, optimized by a
simple DisjointSet (find-union) implementation as described on wikipedia
[http://en.wikipedia.org/wiki/Disjoint-set_data_structure]
new ab85a92 started implementing a Fibonacci Heap data structure, useful
to improve algorithms performance that require storing data in a priority queue
new 653076a added the Fibonacci numbers calculator test case -
implementation is based on cached data to improve performances
new 3b7b8c5 Disjoint-set implementation moved in the collections package
new da4a766 first checkin of collections package descriptor
new 98faedb refactored internal/APIs variables, DisjointSet made
Graph-agnostic
new eca05a6 added add(E) initial implementation
new 1e5076b in FibonacciHeaps, root list is circular
new 514ea33 offer(E) can be equals to add(E), the only constraint is E
has not to be null
new e8d150a in Collections the generic element is denoted with <E>, just
a matter of coherence
new 0a84f07 adjusting FibonacciHeap implementation according to
http://staff.ustc.edu.cn/~csli/graduate/algorithms/book6/chap21.htm not
completed yet, still a TODO
new 545ef60 added inline comments in add() method - and fixed the minNode
replacement bug!
new 38ca271 root concatenation performed at left, as shown in the sample
new 5b4a750 implemented isEmpty() method
new 7f4c32f removed duplicated code
new 7cbe7fb removed yet another redundant code
new 92e2d40 implemented clear() method
new 5f95c83 removed yet another redundant code
new fad2d6e 'value' reference name replaced with 'element' in the
Fibonacci Heap node
new 7dd6ba1 variables properly renamed inside remove() body
new ec580c1 according to java.util.Queue javadoc, remove() Throws
exceptions when poll() returns special values
new 03f9008 according to java.util.Queue javadoc, element() Throws
exceptions when peek() returns special values
new 0acbd62 added inline comments in poll() method
new d6c1844 fixed FIB-HEAP-EXTRACT-MIN(H) according to algorithm
description, consolidate() is still a TODO
new ee58a45 avoid NPEs if minimumNode doesn't have a child
new 3ee5449 used java.util.Queue methods that throw exception by
contract, rather than methods that return special values
new 2d0f0d1 compacted min node child iteration loop
new f51ddaa added the PHI private constant
new d20a27c added consolidate() implementation and rearranges tuff,
FIB-HEAP-LINK is still a TODO
new fd7f97a instead of getting/setting the node degree, added methods to
increase/decrease it
new 7b52629 added FIB-HEAP-LINK(H, y, x) implementation
new 97f3544 trees numbers decreases when removing the min or linking nodes
new eaef07c added CUT(H,x,y) method implementation
new ec11d4e added CASCADING-CUT(H,y) method implementation
new 95107a3 added missing nodeSequence ArrayList initialization
new 54cb2be added toString() method implementation, just for debug
purposes
new 106ee71 fixed broken cycles that didn't allow extracting the minimum
node correctly
new 22b4439 A+ and Dijkstra algorithms now use the Fibonacci Heap instead
of the Binary Heap
new feff00d implemented contains/containsAll methods
new 37cc39b added missing child -> parent while linking
new c7b249e added missing javadoc generic parameters
new e6fe136 the fibonacci numbers don't need to be generated in the
fibonacci heap (numbers are used in the demonstration, not in the data
structure itself)
new 165d833 the fibonacci numbers don't need to be generated in the
fibonacci heap (numbers are used in the demonstration, not in the data
structure itself)
new f2a6f6d dropped statemachine - just an (incomplete) collection of
POJOS without any algorithm implementation
new d486d69 dropped already migrated old components
new ab4adfa dropped jdepend integration - commons-graph doesn't provide
any kind of 3rd parties libraries support
new fb4a9ae dropped visualizer - the internet is full of graph-visualizer
and doesn't need a new prototypal one
new e96ddba suppressed Comparable cast warning
new e193f8a first checkin of Strongly connected component algorithms
package
new ab4f10e just created the flow algorithms package
new af8aad0 first checkin of RevertedGraph class
new 35a38a8 first checkin of Tarjan's algorithm implementation
new 31f325d updating graph release notes
new db2c17b strongly connected component implementation switched to
LinkedHashSet to preserve the order
new e06f08a added missing javadoc
new 9b93dd2 added simple method just to check if the input graph has a
strongly connected component
new 6301962 moved assembly descriptors in the proper location
new 84e860f added hidden construcotor in Tarjan class algorithm
new 21974c4 fixed javadoc violation
new baf2fa4 upgrated parent
new d253aa1 first checkin of KosarajuSharirVisitHandler class
new ece4638 used the SSC achronym to identify the package of
StronglyConnectedComponents algorithms, as used in literature
new e059feb this class cannot be instantiated directly
new 100fcb5 added missing javadoc comment
new 6b0278d first checkin of CheriyanMehlhornGabowVisitHandler class
new 5db0540 first steps of Gabow algorithm
new 07d7e15 moving algorithm logic to the DFS handler
new 8f1c778 changed handler method signature, providing more
informations, to reduce load that clients have to perform on the Graph
new 1119a4c don't perform graph visit inside the handler, just let the
DFS algorithm doing it and handle visit events
new 790dc04 managed the preorder counter
new 4035694 completed the last iteration when discovering edges
new ae34de5 first checkin of Kosaraju test case (just dump, not really
helpful)
new 6aefd29 [SANDBOX-344] No WeightedGraph in current method signatures -
patch submitted by Claudio Squarciarella
new fc9d0ac [SANDBOX-345] Weighted as an interface with generic weight
type - patch submitted by Claudio Squarcella
new acbee36 no needs to buffer the edge output
new a93906b [SANDBOX-346] DotExporter only exports weights that extend
Number - patch provided by Claudio Squarcella
new 7cf255f minor format
new a2869d1 improved main package description
new 514e4f2 added missing contributors
new c051571 added missing issueManagement section
new d019b51 first checkin of Graph Changes descriptor
new 6a0a136 fixed StronglyConnectedComponents package acronym (it has to
be scc, ssc must have been a typo)
new 0f714bd weighted graph no more needed to define input algorithms that
require weighted edges, since generics on edges help on that
new 827d132 just started adding documentation site (just ToC, algos pages
are still empty)
new 2bf71e4 updated ToC in the site descriptor
new 1ba8198 [SANDBOX-356] Generic weight types and updated shortest path
implementations - patch provided by Claudio Squarcella
new 3bdce32 applied GenericWeightTypeAlsoForAStar.patch submitted by
Claudio Squarcella
new ee72430 updated issue summary
new 4edc012 patches contributors mentioned in the `due-to` attribute in
changelist
new 3a11889 [SANDBOX-356] applied monoid wheight to spanning trees
algorithms - patch provided by Claudio Squarcella
new f29b16d Add Eclipse files to svn:ignore.
new 97e4030 added Assertions utility class (copied from BeanUtils2
sandbox)
new 4f5c4d1 [SANDBOX-361] Add fluent APIs to build mutable Graphes
new dd0070a [SANDBOX-358] Early return/termination for graph visit -
patch submitted by Claudio Squarcella
new fb118a9 removed unused field
new baff18c reusing assert expressions instead of repeat the same code
new 2818d24 made builder methods more fluent
new 23e6fe8 reuse assertions to verify label nullability label cannot be
null in the hasCode() method
new e09e292 reuse assertions to verify label nullability label cannot be
null in the hasCode() method label cannot be null in the toString() method
new a2646cf removed unneeded semicolon
new 5e15a83 reuse assertions to verify label nullability label cannot be
null in the hasCode() method
new 5d38eea don't concatenate the strings to obtain the index as string
label
new bc65931 dropped any string concatenation
new 17a0d7e [SANDBOX-364] Adding generic weight type to model - patch
submitted by Claudio Squarcella
new eb61e4d [SANDBOX-366] Move Graph algorithms APIs to fluent APIs
(moved Visit algorithms only)
new 25f3da8 [SANDBOX-366] moved MutableGraph builder APIs in the central
CommonsGraph class
new fb1c260 VisitTestCase uses fluent APIs only
new 8721c16 removed unused commented code
new 3ab21f4 shortcutted the visit algoritms call - each family of
algorithms accepts a different kind of graph inputs (Dijkstra for example can
be applied on directed graphes with weighted edges) that can be checked by the
compiler, so the on(Graph) method is really too much generic
new 174a14a started defining the graph export EDSL (impl is still a TODO)
new b4be2df export APIs moved to fluent APIs
new 904ac1d graph coloring APIs moved to fluent APIs
new b16608b move tests to graph fluent builder APIs
new 5b8f219 [SANDBOX-367] Move base implementations from test to main -
patch submitted by Claudio Squarcella
new 3c23e7b [SANDBOX-355] Provide Flow algorithms - patch provided by
Claudio Squarcella
new fab94c1 graph construction moved to fluent EDSL
new 8958354 removed unused imports
new f55f625 no needs to allocate a wrapper method to build the graph
new 7326368 started adding MaxFlow APIs
new 1b01633 moved SSC algorithms to fluent APIs
new b87fa91 restored method to retrieve the patch cost on a aweighted path
new f7d3097 removed useless empty lines
new 014426b [SANDBOX-355] fix on unchecked type casting - patch provided
by Claudio Squarcella
new 892d27a more predefined weights on top of Number implementations
new d9e6a50 moved MaxFlow algorithms APIs to fluent version
new 55561d3 upgraded junit dependency
new 4692010 moved spanning tree algorithms to fluent APIs
new ddb344d uniforming methods signatures
new 61ebb53 license headers
new ee81cc3 javadoc
new 0178e70 removed @Override annotations, [graph] jdk compliance level
is 1.5
new a9f0434 ignored idea files
new 7ca7c50 replaced unmappable character for encoding UTF-8
new 5b5d280 [SANDBOX-368] change Dijkstra MST api for accept also
Undirect Graph - patch provided by Marco Speranza
new a10f4e1 started adding shortest path fluent APIs
new f9dbbd2 fixed generics type inference - thanks to Emanuele Lombardi
who provided the fix
new c07e4bc [SANDBOX-350] Provide a Reverse-delete algorithm
implementation - patch provided by Marco Speranza
new 86cf1a0 changed flow related generics order, to be coherent how
already declared elsewhere
new 5af4d23 [SANDBOX-370] GraphML format exporter - patch submitted by
Matteo Moci
new 0731445 added SANDBOX-370 in the changelist
new b90fc6b minor format
new 53716c3 typo
new 261ea49 [SANDBOX-372] Make the
org.apache.commons.graph.visit.GraphVisitHandler able to return objects
new fd9e303 removed @Override annotation
new b81f4a3 start streaming data only once keys have been collected
new 3591641 [SANDBOX-374] Kruskal's algorithm doesn't accept sparse graph
- patch submitted by Marco Speranza
new d8169f7 [SANDBOX-375] Add Connected Components algorithms - patch
submitted by Marco Speranza
new 4b83b04 GraphExportException made public
new 884baac moved the node selection logic from the algorithm execution
to node selector itself
new 0629c54 [SANDBOX-348] Implement the Boruvka's algorithm - patch
provided by Marco Speranza
new 597368d Update to commons-parent 23.
new 7e20a15 removed unused assignments
new 6ba54c0 [SANDBOX-380] Add cobertura report and increase test coverage
- patch provided by Marco Speranza
new 15b9b9d [SANDBBOX-381] Unused class GraphColoringBacktraking
new 3c00840 added Matteo Moci in the contributors list
new c992b6f added missing license header
new 3501bcd [SANDBOX-382] Add new test for coloring - patch provided by
Marco Speranza
new 4c4bd92 [SANDBOX-383] Add test for Connectivity - patch provided by
Marco Speranza
new 8455de3 [SANDBOX-384] Add test for Flow Algorithms - patch provided
by Marco Speranza
new 04cc5f3 [SANDBOX-384] Make Graph components Serializable
new b0a0e62 use shortcuts to check non-null arguments
new 1474eba Added more performant version of Boruvkas algorithm. JIRA:
SANDBOX-348
new 30c8b01 added Thomas Neidhart in the developers list
new c5b5423 added missing ASL header
new 2fb97cc SuperVertex members can be final
new 23b1921 trivial format
new 0c10937 added MST benchmarks, code provided by Thomas Neidhart
new 1be86cc added generation comment on XML GraphML
new 51f208d [SANDBOX-385] Provide Edmonds-Karp algorithm - Patch provided
by Claudio Squarcella
new 1640e34 plugged annotations to run draw benchmark charts
new b650fd9 [SANDBOX-388] Generic Type inference doesn't work in Eclipse
- patch provided by Steven Dolg & Claudio Squarcella
new cf036cb removed empty javadoc
new 33b3adb migrated shortest path algorithms to fluent EDSL
new 7a03c30 minor format
new f668d14 typo
new db3b8cb typo
new 71f9d51 some initial sparse doc
new 136d213 defining the documentation DOC
new 80d7c54 let the benchmark be included in the test executions
new 595dc00 shaded all internal-use only classes, so users cannot use
them accidentally (well, they still can, but IDEs such as Eclipse are able to
resolve $* named classes)
new 5ef010d a little more of sparse documentation...
new b6afb42 Added test cases Added PathNotFoundException into
PredecessorList
new 2294a3a fixed english mistakes fixed format error upgraded developer
section
new 2daa0d0 deleted unneeded fail invokation and tested that NPE
exception is only thrown by the method under test.
new 7458625 Removed duplicated test case
new 441cec9 added thow GraphException if the requested vertices not exist
new cb0c6b7 added an internal utility method according to the DRY
principle
new 28443c5 [SANDBOX-391] - removeEdge method: missing implementation
new 16482a0 [SANDBOX-393] Add test for Spanning tree
new 19efe8c Removed unnecessary graph population
new 364f047 Removed unused import and variables
new df5e731 added myself to the developer list of commons graph (aka my
first commit)
new 82837d3 Added check for monoid input argument
new 78adf5f Added missing action for SANDBOX-391 and SANDBOX-393
new 9f7e82e [SANDBOX-394] Check arguments
new 500a6fc Added SuppressWarning annotation
new a5ed47b Added comment for clarify the SuppressWarning annotation
new a6ca979 fixed spelling mistake
new 465cc02 updated notice file
new 698a5e4 [SANDBOX-395] corrected names for classes and variables
related to operations on weights
new 66b2c9e updated benchmark on spanning trees with new names for weight
operations
new f187c22 updated main documentation page with a general introduction
to graphs and a short list of features
new 56cf7d3 updated copyright year
new e7ce74f added documentation for weights (types, operations, usage,
customization)
new 6c428b2 typo in docs for weights
new 237c1ed Updated graph search algorithms according to discussion on ML.
new a8af7ab removed trailing spaces NO FUNCTIONAL CHANGES
new 0560802 The adapted LinkedList can be final
new b2dfbab NoSuchElement exception is an unchecked exception
new 974ff8e moved QueueOrStack type inference in the class definition (it
is known that is a VertexPair DataStructure, so no need to specify it when
instantiating but rather in the type itself)
new b1918b2 QueueOrStack class can be final
new 251fd46 there's no needs of an Aux class that wraps the linked list
new ce874f0 fixed unified graph search algorithm in case of non-default
visitor implementations
new d33275c do not visit multiple edges to the same vertex if it has been
already visited.
new 78246f9 added Kosaraju Sharir algorithm for SCC.
new d73bd5b [SANDBOX-353] Provide a Kosaraju-Sharir's algorithm
implementation
new 7681c56 [SANDBOX-392] Add test for Kosaraju Sharir Algorithm
new 797d35b Removed unneeded empty creation of graph configuration
new 109c1fc [SANDBOX-354] Provide a Tarjan's algorithm implementation
new 15e5825 Removed unused import
new 990faeb [SANDBOX-400] Switch the Base graph implementation underlying
data structures to the thread safe version
new 48adce4 trailing spaces NO FUNCTIONAL CHANGES
new 2b94809 rolled back r1296087 that caused incredible decrease of
performances
new fc8690f just added javadoc comments to specify that data structures
are not thread safe
new 2f3f1a7 [SANDBOX-400] first implementation of methods to synchronize
existing Graph data structures to make them thread-safe
new 54530d9 greatly improved speed of Kosarajus algorithm, added more
unit tests, SCC benchmark and javadoc with runtime complexity information and
algorithm recommendation
new acbc6a0 [SANDBOX-400] Switch the Base graph implementation underlying
data structures to the thread safe version
new e601e47 inverted modifiers order
new 7aced19 private GraphInvocationHandler fields can be final
new e588668 this reference not needed
new 19694b1 shield bot synchronized and not invocations from
InvocationTargetException
new 1a913cc side effects of c'n'p :P
new 7b927f5 improved Boruvkas MST algo, improved MST benchmark, minor
formatting fixes
new f9d338a removed unnecessary modifier
new 2a061ad added initial checkstyle.xml, removed duplicate getWeight
interface method, javadoc cleanup
new 69e9602 more checkstyle fixes
new cf5714d removed vetoed checkstyle.xml
new d9baa9e minor javadoc and checkstyle fixes for algorithm selectors.
new 80de053 Removed unneeded GroboUtil dependency
new bc75a6f [SANDBOX-352] - Provide Cheriyan-Mehlhorn/Gabow's strongly
connected component algorithm implementation
new 9423326 added javadoc, added gabow algo to scc benchmark, removed
obsolete Kosaraju visit handler
new 05b39c6 simplify the verbosity of SCC algorithms - related to
[SANDBOX-351]
new 5aaca71 dropped System.out invocation
new 96f7c9b created the branch to work on the dropping marker interfaces
feature - see [SANDBOX-409]
new ae68839 [SANDBOX-409] started brute-forcing dropping all marker
interfaces - code obviously doesn't compile but anyway this is the experimental
branch
new 9535338 just organized imports, NO FUNCTIONAL CHANGES
new 281ab92 no more WeightedGraph - still broken but going to the right
direction
new 5a95e93 started defining the function that get the edges weight -
edges are now graph type agnostic
new 291f217 adjusting shortestpath A* test case
new 49fad8a adjusting BellmannFordTestCase according to new API
new d4cc300 adjusting DijkstraTestCase according to new API
new 1470db7 adjusting FloydWarshallTestCase according to new API
new 6401dca restored SpanningTree class and adapted to current APIs
new e4482f5 MutableSpanningTree has to implement SpanningTree
new 8a0ef66 organized imports
new 070c7bb renamed WeightedEdges to a general Mapper (same interface
will be reused for algorithms where weights will be associated to vertices)
new af84249 [SANDBOX-404] simplify weight model: merge Zero and Semigroup
into Monoid and get rid of OrderedMonoid (replaced by the combination Monoid &
Comparator)
new 36cbd73 WeightedEdge doesn't exist anymore
new ae2aa94 weights no longer retrieved from edges
new ef647cf updated after the Mapper rename
new cea7f3c updated spanning tree algorithms API according to new Mapper
to retrieve weights of graph edges
new 6d1a4b3 SpanningTree algos refactored according to new APIs
new 6d6e86e plugged the edge mapper inside the weighter path
new dc8c504 plugged the edge mapper inside the weighted spanning tree
new a189dd6 test update after latest APIs change
new 6808a58 fixed compilation issues
new 5b43775 fixed method invocation
new 00e3962 fixed compilation issues
new 891109f added builder to plug the mapper that gives weights for edges
new c907045 plugged builder to plug the mapper that gives weights for
edges
new 1163d4d linking mapper that gives weights for edges
new 3e25885 the visit handler has to use now the Mapper to get edge weight
new 0dcd1d8 completed the builder chain for Flow algorithms - note that
there is a compilation issue due to conceptual changes!
new ed13659 test refactored according to latest APIs changes
new 43df84e fixed compilation issues
new c9140b4 trying to centralize junit imports from org.junit
new e04fdbe code format
new 8cf86c7 fixed MSP benchmarks according to latest APIs modifications
new c22dee9 resolved compilation issues, used an edge wrapper due to the
missing Edge supertype
new 6d9886a resolved compilation problems due to the refactoring
new ff7f0c3 hide internal stuff just before to create the package
new ac0888d hide vertices/edges export ATM - once lost supertypes, a
different strategy is needed to hadle graph elements properties
new 8fe0d50 fixed broken wrapper behavior, return 0 when wrapped edge
doesn't exist
new 4a929a2 Initialized merge tracking via "svnmerge" with revisions
"1-1297889" from https://svn.apache.org/repos/asf/commons/sandbox/graph/trunk
new d2e5d5b merged simplified version of [SANDBOX-404]
new f4397db simplified generic signatures everywhere - generics are
useful to infer types in builder chains, but unused generics have been removed
to simplify both maintainability and readability
new d202d4b used generic types extensions for Vertices/Edges arguments
new 1f7dfc9 used generic types extensions when used as arguments
new 85c24bf reflected Connector APIs in the Abstract module
new e585f68 [SANDBOX-404] fixed error in tests: added cast to null weight
operations
new 7ed2ed2 updated parent pom to 24
new 8aa8f39 avoid hardcoded target jdk version
new 56481e2 upgraded checkstyle plugin to 2.9.1
new 3b86743 Improved javadoc and fixed class typo in export package.
new b56d867 Removed unnecessary new line in graph ml exporter.
new b7f646e initial proposal for exporter: reorganized exporters with
SAX-alike APIs, managed Vertices/Edges properties with existing Mapper, GaphML
is still a TODO
new 41955e3 main resources not needed ATM
new fc2a7a9 explicit basedir
new 8acf879 test resources dir doesn't exist
new 6041ca1 creating branch for experiments on new graph exporters
new ebed328 proof of concept with tests using the new proposed API -- the
code compiles but it does not work yet
new f61dfcd organized imports
new 0d64851 dropped commented methods trailing spaces on empty lines
new b103cf1 no tabs
new 0d06767 avoid to return the abstract exporter implementation, it
would lose the state - return the concrete impl instead
new b031102 reintegrated stream builders dropped no longer used used
constructors
new fb88405 code format
new 3dba750 shortcut constructors not needed reduced concrete exporters
constructors visibility - they can be instantiated only in the package
new 1e5a428 code format
new 47e8e32 algorithm selection no longer throws exceptions
new 17186fc Edge/Vertex property selector no longer needed in the new
architecture
new 3dbe499 code format
new 0cba6f4 properties setters always return the current exporter
instance code format
new f6efe84 properties setters always return the current exporter
exporter instance
new 088abf7 no needs for shortcut constructors, name instance would be
passed anyway
new a73533d correct interface names for ExportSelector (was
ExportSelctor) and DefaultExportSelector (was DefaultNamedExportSelector).
remove unused interface NamedExportSelctor.
new f369be6 removed property setters (withEdgeWeights, etc) from
AbstractExporter, replaced them with protected methods (addEdgeProperty,
addVertexProperty) that can be called by the concrete implementations
new 96548e7 implemented property setters for DOT exporter
(withEdgeWeights, withEdgeLabels and withVertexLabels) calling the protected
methods (addEdgeProperty, addVertexProperty) of AbstractExporter
new a41adfa factored out property writing for edge/vertex and fixed
output format (still more to do!) for DOT exporter
new a8fa878 added utility method to generate IDs for vertices and
replaced use of vertex hash codes with IDs when formatting the output (hash
codes are not identifiers!)
new a9ebe8d corrected output format: property names are not quoted, while
property values are -- actually only strings should be quoted, so this needs
further refinement based on property type
new 6c3c10f reintegrated the dropped marker interfaces work and improved
exporter in trunk
new 2547e7a Replaced unordered list with a sorted queue.
new 2590071 restored the NamedExportSelector
new c737a2a fixed compilation issues, class restored from the wrogn
location :/
new 1e62a4c NamedExportSelector reintegrated in the builder chain
new 665f0b7 guard Queue consumption via the empty status
new a546a70 started defining the `elo` package for the Elo Rating System
new 0084937 first checkin of Category interface
new 5bd0d37 let's start with a simple type first, then will be
generalized (actual Monoids just support Addition ATM)
new b533340 first spike implementation of the core ELO evaluator algorithm
new 712900b virtualize the way to get/set the player ranking
new 1b8aaf6 started creating the EDSL for ELO algorithm
new 6867769 first checkin of VisitState enumeration, related to
[SANDBOX-416]
new df1e1be [SANDBOX-416] used states in graph visits, replacing
ambiguous boolean values to determine when to abort prematurely and/or skip
edges/vertices.
new d8fe0c6 statically imported the VisitState.CONTINUE state
new 7d989b3 just statically imported VisitState values
new 0a1a8ea typo :P
new 1e2ae1e finally found a way to arrange the ELO algorithm
new b48cee9 linked the ELO algorithm executor
new e23d104 in search/visit algorithms, added support for
VisitState.ABORT also when discovering edges/vertices for the first time
new 1f2b9ac statically imported VisitState constants
new c2b7169 expected values first
new 384303b added first ELO test implementation
new 0a498a5 no LOSE status, the graph is directed (a directed Edge means
win or draw)
new ee5f452 [SANDBOX-386] Make Graph components Serializable
new 403873c [SANDBOX-386] Make Graph components Serializable
new a5b3f85 Added missing license header
new e88dd93 eliminate equals/hashcode boilerplate code with simply
utility methods
new bf91fbf Fixed formatting mistakes
new f2b38d7 [SANDBOX-386] Make Graph components Serializable
new ae4d39b Fixed checkstyle warnigs
new 55f149c Fixed checkstyle warnigs
new 0a3320f Removed unsatisfied javadoc links to class Edge and Vertex
new b862f7a trivial format
new 6d45ffc trivial format
new 78b95a5 checkSerialization() method can be static
new 85ac626 vertices can be created, added to the graph and assigned to a
variable in one-shot
new aea0b67 CommonsGraph static methods imported statically
new b6d5186 reivial format
new 37dcf3b internal utility methods can be static
new dd0977d no needs to assign graph connections to a variable before
returning them
new a3f5a27 except the main SyncGraph, all other impls can be final
new 1a1b31e dropped empty spaces on empty lines
new ba22ca7 typo
new 04a81e2 dropped unused generic types
new 19afc74 trailing spaces on empty lines
new c02cd54 just added the nothe that the provided FibonacciHeap
implementation is not thread safe
new 3d1b040 added javadoc, no functional modifications
new 07c7558 added javadoc, no functional modifications
new 1e35271 added javadoc, no functional modifications
new 3434420 trivial javadoc, no functional modifications
new c155061 clear operation has to clear the stored objects index as well
new 8d0b433 added note that the current FibonacciHeap implementation
doesn't support null values
new 543abae added missing Queue#addAll() method implementation (note that
add() always return true)
new a56da88 Collection methods with no implementation throw
UnsupportedOperationException rather than doing nothing (it would be confusing
for users)
new 39b7d27 initial checkin of FibonacciHeapTestCase
new 064c567 fixed wrong embedded comment in cascadingCut() method
new e96f3fd more embedded comment inside cascadingCut() method
new 75bbdaf more inline comments on cut() and cascadingCut() methods
new 8e3b5a8 fixed html entities in javadoc comments
new cb42a86 add() method renamed to insert() to remind the
FIB-HEAP-INSERT function as described in the paper
new 98b71e0 added javadoc comment to the insert() method
new 1a1fa95 according to the paper, size increasing is a FIB-HEAP-INSERT
operation according to the paper, when performing a FIB-HEAP-INSERT, it
increases the size but not the #of nodes
new 4c3688a s/<-/←/ for a better javadoc rendering
new 553396c implemented node initialization when performing an INSERT
new 49e1d76 more embedded comments in insert() method
new c556e2f added more link() javadoc
new c107598 according to the paper, FIB-HEAP-LINK doesn't mention that
trees number has to be decreased
new d8f3ac6 added CONSOLIDATE function inline javadoc comments (and found
a giant bug!)
new 05b4787 heap node initialization in the node itself (dropped the ugly
'reset degree' method) still working on the CONSOLIDATE method
new 2e52245 added FIB-HEAP-EXTRACT-MIN(H) embedded comments step 4-5
maybe don't work as expected... :/
new a500965 just added embedded comments, no functional changes
new 1b35dd4 added the FibonacciHeap#moveToRoot( FibonacciHeapNode<E> node
) method and fixed wrong assumptions in add(), consolidate() and cut() methods
new 447c383 element.toString() can be safety invoked since the
FibonacciHeap prevents the addition of null elements
new 661d08c use the utility method to check non null elements in add()
arguments
new 960a747 each time a FibonacciHeapNode is (un)marked, the markedNodes
counter (de|in)creases
new 0676a31 added missing javadoc
new cb7d660 filled javadoc
new 832eb9b s/e/element
new 026e464 - Fixed SANDBOX-425: FibonacciHeap enters in an infinite loop
when applying SpannigTree algorithms - Added some unit tests to FibonacciHeap -
Moved Spannong tree algo to fibonacci heap
new 7db686c queues can be referenced as Queue instance rather than
specialized FibonacciHeap
new 1be94d5 dropped trailing spaces on empty lines, no functional
modifications
new cace280 trivial format, no functional modifications
new fa8885e imported Collections#sort() static method
new 371516c dropped trailing spaces on empty lines, no functional
modifications
new 812ac94 dropped unnecessary empty lines, no functional modifications
new d94d776 code format, no functional modifications
new 440c7a2 dropped unnecessary empty lines, no functional modifications
new 91fab03 javadoc format, no functional modifications
new 3f36357 use StringBuilder to create the heap representation rather
than the StringBuffer
new 2695899 dropped unnecessary empty lines, no functional modifications
new ebe2627 dropped duplicated code
new 36e4a9d code format, no functional modifications
new 7504291 dropped duplicated code
new 97d2d87 Added new tests case
new 8b3a74a Dropped unnecessary method
new a628685 Suppressed LineLength rule for checkstyle
new 03ec5dc Dropped unnecessary empty lines, no functional modifications
new 00cb51d fixed checkstyle errors in header
new 305ff69 Fixed 'MagicNumber' checkstyle error
new 1487511 code formatting, no functional modifications
new eadf3c1 Fixed 'Avoid star import', no functionl modifications.
new 4d70f6a Fixed 'EqualsHashCode' checkstyle error, no functionl
modifications.
new 4d6225a Fixed 'unused import' checkstyle error, no functionl
modifications.
new 1b449f1 Fixed 'unused import' checkstyle error, no functionl
modifications.
new db03aaa Replaced hashCode implementation with
org.apache.commons.graph.utils.Objects#hash()
new ab07def Fixed 'missing javadoc' checkstyle info, no functionl
modifications.
new 4be2106 Added taglist plugin
new 4593a24 Filled some javadocs, no functional modifications
new 15f4415 Filled some javadocs, no functional modifications
new da3f223 Fixed typo in method name
new e805dda Filled some javadocs, no functional modifications
new c6997b0 Filled some javadocs, no functional modifications
new ba9310d Filled some javadocs, no functional modifications
new 3ec36c8 commons-parent updated to v25
new 9e3b3d2 plugin's configuration is used to store Eclipse m2e settings
only. It has no influence on the Maven build itself
new 03f3879 //action/@issue attribute first in each action to make easier
keeping the actions sorted desc
new 772d0ef sorted //action elements by //action/@issue DESC
new 77de890 sorted //action elements by //action/@issue DESC
new 999996b muted the SVUID warning (they are just test classes)
new 2a31091 javadoc - no functional modifications
new 8d9813a started restoring the GraphML exporter, but using the
javax.xml.transform.sax.TransformerHandler rather than the
javax.xml.stream.XMLStreamWriter, that is not available in java5 (which is
commons-graph jvm target)
new ea9630a typo
new 7f7c135 javadoc format, no functional modifications
new 48d1ff1 added myself in the commons/graph developers section
new ce12d73 SANDBOX-457 - Adding an implementation of a bidirectional
Dijkstra's algorithm
new cd8e94e Add Apache prefix and (Sandbox) suffix
new 86481d7 SANDBOX-349: Verify Prim's and Kruskal's algorithms
correctness - applying Rogério Theodoro de Brito's first three patches
The 791 revisions listed above as "new" are entirely new to this
repository and will be described in separate emails. The revisions
listed as "add" were already present in the repository and have only
been added to this reference.
