* Frontend: Graph accepting adjacency list.

Added the forntend where edges are added in the adjacency list type
of graph implementation.

Signed-off-by: Rishikesh Donadkar <[email protected]>

* Frontend: Graph accepting adjacency list.

Added the forntend where edges are added in the adjacency list type
of graph implementation.

Signed-off-by: Rishikesh Donadkar <[email protected]>

* added additional function to print adjList

* Sarrah+Rishi final code working

* Added all 4 cases of incidence matrix

* clang format and adj mat

* doxygen docs

* removed redundancy in using memref_descriptor

* Docs generated and relevant instructions added

* clean up of docs

* Added Graph Container

* Finished formatting the code

Spaces were added after the // in the comments, and incorrect formatting was fixed.

* Added documentation for new code

* Added documentation

* Remove redundant doxygen related file

* Improved Container interface.

* Added Description of a constructor

* Trivial changes

Trivial changes

Signed-off-by: Rishikesh Donadkar <[email protected]>
Co-authored-by: Rishikesh Donadkar <[email protected]>
Co-authored-by: Sarrah Bastawala <[email protected]>
Co-authored-by: Sarrah Bastawala <[email protected]>
Co-authored-by: rishabh <[email protected]>
Co-authored-by: Rishabh Bali <[email protected]>
Co-authored-by: meshtag <[email protected]>

…and end to end example, along with benchmarking support (meshtag#22)

Co-authored-by: Gautam Agrawal <[email protected]>

* Add benchmarking for GraphMLIR based bellman ford
  algorithm
* Add benchmarking for Lemon based bellman ford
  algorithm

(Note: Number of vertices has been taken as 100 in
 both the benchmarking)