<commit_before># HISTORY #

Changes to JGraphT in each version:

- **version 1.0.0** (under development):
	- Moved to JDK 1.8 (cleanup contributed by <NAME>)
	- Fixes for `MaskSubgraph`, contributed by <NAME>
	- Optimized edge lookups (contributed by <NAME>)
	- Use LinkedHashSet in `CycleDetector` (contributed by <NAME>)
	- Use unique OSGi bundle symbolic name for uber artifact (contributed by <NAME>)
	- Replace experimental GraphReader with `DIMACSImporter` (contributed by <NAME>)
	- Implement various graph utility methods (contributed by <NAME>)
	- Add getFirstHop and getLastHop to `FloydWarshallShortestPaths` (contributed by <NAME>)
	- Allow paths to be expressed in terms of vertices instead of edges; deprecate `GraphPathImpl` in favor of new `GraphWalk` (contributed by <NAME>)
	- Weighted graph support in `GmlExporter` (contributed by <NAME>)
	- Add `RandomWalkIterator` (contributed by <NAME>)
	- Add `GreedyMultiplicativeSpanner` (contributed by <NAME>)
	- Support undirected graphs in max flow algorithms (contributed by <NAME>)
	- Fix for reading escaped quotes in `DOTImporter` (contributed by <NAME>)
	- Add `BidirectionalDijkstraShortestPath` (contributed by <NAME>)
	- Add external path validator for `KShortestPaths` (contributed by <NAME>)
	- Add `GmlImporter` (contributed by <NAME>)
	- Fixed bug in HopcroftKarpBipartiteMatching which caused the algorithm to occasionally throw a NullPointerException (contributed by <NAME>, bug reported by <NAME>)
	- Fixed `AStarShortestPath` to use Object.equals (contributed by <NAME>, bug reported by Zgce)
	- Enhance `DirectedAcyclicGraph` to extend Iterable (contributed by <NAME>, suggested by <NAME>)
	- Enhance `MinSourceSinkCut` to make max-flow implementation configurable (contributed by <NAME>, suggested by <NAME>)
	- Add new vertex cover algorithms and package (contributed by <NAME> and <NAME>)
	- Improved GraphML support (contributed by <NAME>)
	- Add common `GraphExporter` and `GraphImporter` interfaces (contributed by <NAME>)
	- DOT importer id fix (contributed by <NAME>)
	- Add `CSVExporter` and `CSVImporter` (contributed by <NAME>)
	- Add `MinimumSTCutAlgorithm` (contributed by <NAME>)
	- Capture trivial paths in `AllDirectedPaths` (contributed by <NAME>)
	- Switch from Jalopy source code formatter to Eclipse, since Jalopy does not support java 8 (contributed by <NAME>)
	- Fixed a bug in `RandomGraphGenerator`, reported by (@ckapop), which could cause an overflow when calculating the maximum number of edges allowed in a graph (contributed by <NAME>)
	- Added generics to code in test package (contributed by <NAME>)
	- Fixed a bug in `PushRelabelMFImpl`, reported by <NAME>, which caused a NullPointerException whenever the network contained multiple components (contributed by <NAME>)
	- Fixed a bug in `MaximumFlowAlgorithmBase`: some vertices ended up with a null prototype vertex (contributed by <NAME>)
	- Use equals for compare to fix bug in `EdmondsBlossomShrinking` (contributed by <NAME>)
        - Reformat all file headers (contributed by <NAME>)

- **version 0.9.2** (3-Apr-2016): 
	- Add `HawickJamesSimpleCycles`, contributed by <NAME>
	- Add `DOTImporter`, contributed by <NAME>
	- Optimize `FloydWarshallShortestPaths`, contributed by <NAME><commit_msg>Credits for last merge.<commit_after># HISTORY #

Changes to JGraphT in each version:

- **version 1.0.0** (under development):
	- Moved to JDK 1.8 (cleanup contributed by <NAME>)
	- Fixes for `MaskSubgraph`, contributed by <NAME>
	- Optimized edge lookups (contributed by <NAME>)
	- Use LinkedHashSet in `CycleDetector` (contributed by <NAME>)
	- Use unique OSGi bundle symbolic name for uber artifact (contributed by <NAME>)
	- Replace experimental GraphReader with `DIMACSImporter` (contributed by J<NAME>)
	- Implement various graph utility methods (contributed by <NAME>)
	- Add getFirstHop and getLastHop to `FloydWarshallShortestPaths` (contributed by <NAME>)
	- Allow paths to be expressed in terms of vertices instead of edges; deprecate `GraphPathImpl` in favor of new `GraphWalk` (contributed by J<NAME>)
	- Weighted graph support in `GmlExporter` (contributed by <NAME>)
	- Add `RandomWalkIterator` (contributed by <NAME>)
	- Add `GreedyMultiplicativeSpanner` (contributed by <NAME>)
	- Support undirected graphs in max flow algorithms (contributed by J<NAME>)
	- Fix for reading escaped quotes in `DOTImporter` (contributed by <NAME>)
	- Add `BidirectionalDijkstraShortestPath` (contributed by <NAME>)
	- Add external path validator for `KShortestPaths` (contributed by <NAME>)
	- Add `GmlImporter` (contributed by <NAME>)
	- Fixed bug in HopcroftKarpBipartiteMatching which caused the algorithm to occasionally throw a NullPointerException (contributed by <NAME>, bug reported by N<NAME>)
	- Fixed `AStarShortestPath` to use Object.equals (contributed by <NAME>, bug reported by Zgce)
	- Enhance `DirectedAcyclicGraph` to extend Iterable (contributed by <NAME>, suggested by <NAME>)
	- Enhance `MinSourceSinkCut` to make max-flow implementation configurable (contributed by <NAME>, suggested by <NAME>)
	- Add new vertex cover algorithms and package (contributed by <NAME> and <NAME>)
	- Improved GraphML support (contributed by <NAME>)
	- Add common `GraphExporter` and `GraphImporter` interfaces (contributed by <NAME>)
	- DOT importer id fix (contributed by <NAME>)
	- Add `CSVExporter` and `CSVImporter` (contributed by <NAME>)
	- Add `MinimumSTCutAlgorithm` (contributed by <NAME>)
	- Capture trivial paths in `AllDirectedPaths` (contributed by <NAME>)
	- Switch from Jalopy source code formatter to Eclipse, since Jalopy does not support java 8 (contributed by <NAME>)
	- Fixed a bug in `RandomGraphGenerator`, reported by (@ckapop), which could cause an overflow when calculating the maximum number of edges allowed in a graph (contributed by <NAME>)
	- Added generics to code in test package (contributed by <NAME>)
	- Fixed a bug in `PushRelabelMFImpl`, reported by <NAME>, which caused a NullPointerException whenever the network contained multiple components (contributed by <NAME>)
	- Fixed a bug in `MaximumFlowAlgorithmBase`: some vertices ended up with a null prototype vertex (contributed by <NAME>)
	- Use equals for compare to fix bug in `EdmondsBlossomShrinking` (contributed by <NAME>)
	- Reformat all file headers (contributed by <NAME>)
	- Refactor and enhance random graph generators (contributed by <NAME>)

- **version 0.9.2** (3-Apr-2016): 
	- Add `HawickJamesSimpleCycles`, contributed by <NAME>
	- Add `DOTImporter`, contributed by <NAME>
	- Optimize `FloydWarshallShortestPaths`, contributed by <NAME>
{'fraction_non_alphanumeric': 0.09139052806778636, 'fraction_numerical': 0.004236646996519897, 'mean_word_length': 5.143122676579925, 'pattern_counts': {'":': 0, '<': 90, '<?xml version=': 0, '>': 90, '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': '439811', 'n_tokens_mistral': 2021, 'n_tokens_neox': 1882, 'n_words': 801}