AlgoDaily - Implementing Graphs: Edge List, Adjacency List, Adjacency Matrix

Adjacency Matrix & List | Overview, Graphs & Examples

Problem StatementSometimes when dealing with graphs, it is easiest to leave it in its input format rather than creating another structure like an adjacency list/matrix. You are given a graph represented as a vector of strings. Write afunction traverse (vector graph) that takes as input a graph and returns the length of the shortest path between vertices s and t. If no path exists between s and t, then return -1. The details of thegraph as a vector of strings are as follows:• The start positio