abdur-rahmaanj/graph-theory

Implementation of a directed and weighted graph, along with finding the shortest path in a directed graph using breadth first search, and finding the shortest path in a weighted graph with Dikstra and Bellman Ford algorithms.

Graph-Theory

Implementation of a directed and weighted graph, with graph algorithms.

NOTE

The Python files are way more developed than the Java ones, you should probably look at those.

Python

Implementations

Directed Graph (Adjacency List)
Weighted Graph (Adjacency List)

Traversal

Breadth First Search
Depth First Search

Shortest Path

Breadth First Search Shortest Path (Directed Graph)
Dikstra's Shortest Path (Weighted Graph)
Bellman Ford's Shortest Path (Weighted Graph)
Optimized Bellman Ford's Shortest Path (Weighted Graph)

Java

Implementations

Directed Graph (Adjacency List)
Weighted Graph (Adjacency List)
Directed Graph (Adjacency Matrix)
Weighted Graph (Adjacency Matrix)

Shortest Path

Dikstra's Shortest Path (Adjacency List)
Bellman Ford's Shortest Path (Adjacency List)