How to Convert a Directed Graph to an Undirected Graph (Adjacency Matrix) [closed]
-
03-11-2019 - |
Question
Given an adjacency matrix, what is an algorithm/pseudo-code to convert a directed graph to an undirected graph without adding additional vertices (does not have to be reversable)?
similar question here
No correct solution
Licensed under: CC-BY-SA with attribution
Not affiliated with cs.stackexchange