Assignment 1. Graph representations
Completion requirements
Design a program that reads an undirected graph description in edge list format and outputs the same graph representations as adjacency matrix and adjacency list.
Input:
•1st line: a space separated list of vertex names
•Other lines: each line represents an edge (space separated vertex names).
Output: 2 files - adjacency matrix and adjacency list.
- 20 March 2023, 5:58 PM
- 12 February 2023, 8:07 PM