<commit_before># simgraf
A simple graph library written in Java.
Easily extensible.

Unlike other popular Java graph libraries, <b>simgraf</b> is not aimed to graph visualization. It is aimed to provide a versatile set of graph data structures and algorithms focused on time efficiency.  

This library contains 2 main packages:
* graphs: Contains 2 graph classes and 2 edge classes
    * DirectedGraph
    * UndirectedGraph
    * Edge
    * WeightedEdge


* algorithms: Contains 4 algorithms for the graphs
    * BFS (Breadth-First Search)
    * DFS (Depth-First Search)
    * Bellman-Ford
    * Dijkstra

For each graph the user can choose if loops are allowed and if multiple edges between two vertices are allowed.

The vertices can be of any type and the edges must be of class Edge/WeightedEdge or a subclass of them.

###### Development

The graphs and algorithms have been finished and are documented and tested. Some edge cases are still to be tested.

If you have coded an algorithm for this library I encourage you to do a pull request.

###### License

BSD 3-Clause License
<commit_msg>Readme update<commit_after># simgraf
A simple graph library written in Java.
Easily extensible.

Unlike other popular Java graph libraries, <b>simgraf</b> is not aimed to graph visualization. It is aimed to provide a versatile set of graph data structures and algorithms focused on time efficiency.  

This library contains 2 main packages:
* graphs: Contains 2 graph classes and 2 edge classes
    * DirectedGraph
    * UndirectedGraph
    * Edge
    * WeightedEdge


* algorithms: Contains 4 algorithms for the graphs
    * BFS (Breadth-First Search)
    * DFS (Depth-First Search)
    * Bellman-Ford
    * Dijkstra

For each graph the user can choose if loops are allowed and if multiple edges between two vertices are allowed.

The vertices can be of any type and the edges must be of class Edge/WeightedEdge or a subclass of them.

###### Development

The library is ready for production. It has been thoroughly tested and documented, although some documentation has to be polished.

If you have coded an algorithm for this library I encourage you to do a pull request.

###### License

BSD 3-Clause License

{'fraction_non_alphanumeric': 0.04839439167797377, 'fraction_numerical': 0.004522840343735866, 'mean_word_length': 3.787878787878788, 'pattern_counts': {'":': 0, '<': 7, '<?xml version=': 0, '>': 7, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 2, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
{'dir': 'git-commits-cleaned', 'id': '6997860', 'n_tokens_mistral': 589, 'n_tokens_neox': 559, 'n_words': 317}