<commit_before>A Dijkstra package to find the shortest path.

Copy the contents of this repository to python package directory.

Usage example:
	from Dijkstra import Dijkstra, Graph

	graph = Graph()
	graph.addEdge("chennai", "bangalore", transit_time=200)
	graph.addEdge("bangalore", "mysore", transit_time=150)

	dijk = Dijkstra()
	traversal_path = dijk.minPath(graph, "mysore", "bangalore", return_list=True) # minPath returns a list of path in order<commit_msg>fixed intentation<commit_after>A Dijkstra package to find the shortest path.

Copy the contents of this repository to python package directory.

Usage example:

	from Dijkstra import Dijkstra, Graph

	graph = Graph()
	graph.addEdge("chennai", "bangalore", transit_time=200)
	graph.addEdge("bangalore", "mysore", transit_time=150)

	dijk = Dijkstra()
	traversal_path = dijk.minPath(graph, "mysore", "bangalore", return_list=True) # minPath returns a list of path in order
{'fraction_non_alphanumeric': 0.09839572192513368, 'fraction_numerical': 0.012834224598930482, 'mean_word_length': 5.933333333333334, 'pattern_counts': {'":': 0, '<': 3, '<?xml version=': 0, '>': 3, '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': '1475559', 'n_tokens_mistral': 320, 'n_tokens_neox': 294, 'n_words': 96}