<commit_before># HISTORY #

Changes to JGraphT in each version:

- **version 0.9.1** (under development): 
	- Auto-generation of bundle manifest, contributed by <NAME>
	- Travis CI configuration, contributed by <NAME>
	- TarjanLCA bugfix, contributed by <NAME>
	- Add `SimpleGraphPath`, contributed by <NAME>
	- Add `NaiveLcaFinder`, contributed by <NAME>
	- Make getEdgeWeight throw NPE on null edge, suggested by <NAME>
	- Clarify that shortest path length is weighted, per gjafachini
	- Add DAG constructor that takes an edge factory, and make TarjanLCA constructor public, contributed by <NAME>
	- Fixed rounding error in graph generation, contributed by Siarhei
	- Fixed Javadoc for `DirectedWeightedMultigraph`, noticed by <NAME>
	- Use annotations to simplify test suites, contributed by <NAME>

- **version 0.9.0** (06-Dec-2013): 
	- Move to github for source control, and Apache Maven for build, contributed by <NAME>, <NAME>, and <NAME>.
	- Add source/target vertices to edge events to fix sf.net bug 3486775, spotted by <NAME>.
	- Add `EdmondsBlossomShrinking` algorithm, contributed by <NAME>.
	- Fix empty diameter calculation in `FloydWarshallShortestPaths`, contributed by <NAME> (bug spotted by <NAME>)
	- Add `HopcroftKarpBipartiteMatching` and `MinSourceSinkCut`, contributed by <NAME>
	- Fix multiple bugs in `StoerWagnerMinimumCut`, contributed by <NAME>
	- Fix path weight bug in `FloydWarshallShortestPaths`, contributed by <NAME>
	- Add `PrimMinimumSpanningTree`, contributed by <NAME>
	- Add `DirectedWeightedPseudograph`, and fix 'DirectedMultigraph' contributed by <NAME>
	- More KSP bugfixes (spotted by <NAME>, fixed by <NAME>)
	- Add `KuhnMunkresMinimalWeightBipartitePerfectMatching` and associated generators+interfaces (contributed by <NAME>)
	- Add cycle enumeration (contributed by <NAME>, originally from http://code.google.com/p/niographs/ )
	- Update `removeAllEdges` to match specification (contributed by <NAME>)
	- Add `TarjanLowestCommonAncestor`, contributed by <NAME>
	- Add `JGraphXAdapter`, contributed by <NAME> and <NAME>
	- Add LGPL/EPL dual licensing, coordinated by <NAME>
	- Refactoring for `DirectedAcyclicGraph`, contributed by <NAME>
<commit_msg>Credits for last commit.<commit_after># HISTORY #

Changes to JGraphT in each version:

- **version 0.9.1** (under development): 
	- Auto-generation of bundle manifest, contributed by <NAME>
	- Travis CI configuration, contributed by <NAME>
	- TarjanLCA bugfix, contributed by <NAME>
	- Add `SimpleGraphPath`, contributed by <NAME>
	- Add `NaiveLcaFinder`, contributed by <NAME>
	- Make getEdgeWeight throw NPE on null edge, suggested by <NAME>
	- Clarify that shortest path length is weighted, per gjafachini
	- Add DAG constructor that takes an edge factory, and make TarjanLCA constructor public, contributed by <NAME>
	- Fixed rounding error in graph generation, contributed by Siarhei
	- Fixed Javadoc for `DirectedWeightedMultigraph`, noticed by <NAME>
	- Use annotations to simplify test suites, contributed by <NAME>
	- Add missing Override/Deprecated annotations, contributed by <NAME>

- **version 0.9.0** (06-Dec-2013): 
	- Move to github for source control, and Apache Maven for build, contributed by <NAME>, <NAME>, and <NAME>.
	- Add source/target vertices to edge events to fix sf.net bug 3486775, spotted by <NAME>.
	- Add `EdmondsBlossomShrinking` algorithm, contributed by <NAME>.
	- Fix empty diameter calculation in `FloydWarshallShortestPaths`, contributed by <NAME> (bug spotted by <NAME>)
	- Add `HopcroftKarpBipartiteMatching` and `MinSourceSinkCut`, contributed by <NAME>
	- Fix multiple bugs in `StoerWagnerMinimumCut`, contributed by <NAME>
	- Fix path weight bug in `FloydWarshallShortestPaths`, contributed by <NAME>
	- Add `PrimMinimumSpanningTree`, contributed by <NAME>
	- Add `DirectedWeightedPseudograph`, and fix 'DirectedMultigraph' contributed by <NAME>
	- More KSP bugfixes (spotted by <NAME>, fixed by <NAME>)
	- Add `KuhnMunkresMinimalWeightBipartitePerfectMatching` and associated generators+interfaces (contributed by <NAME>)
	- Add cycle enumeration (contributed by <NAME>, originally from http://code.google.com/p/niographs/ )
	- Update `removeAllEdges` to match specification (contributed by Graham Hill)
	- Add `TarjanLowestCommonAncestor`, contributed by <NAME>
	- Add `JGraphXAdapter`, contributed by <NAME> and <NAME>
	- Add LGPL/EPL dual licensing, coordinated by <NAME>
	- Refactoring for `DirectedAcyclicGraph`, contributed by <NAME>

{'fraction_non_alphanumeric': 0.09362460989745876, 'fraction_numerical': 0.008470798038341507, 'mean_word_length': 5.0228187919463085, 'pattern_counts': {'":': 0, '<': 65, '<?xml version=': 0, '>': 65, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
{'dir': 'git-commits-cleaned', 'id': '3765805', 'n_tokens_mistral': 1395, 'n_tokens_neox': 1302, 'n_words': 509}