How do you represent a graph in computer memory, and how does it affect the performance of Topological Sorting algorithm?

How do you represent a graph in computer memory, and how does it affect the performance of Topological Sorting algorithm?

题目类型: 技术面试题

这是一道技术面试题，常见于澳洲IT公司面试中。

难度: easy

标签: interviewbit, tiger-analytics, company-specific

目标公司: Tiger Analytics

参考答案摘要

An adjacency matrix or an adjacency list are two methods that a graph can be stored in computer memory. A 2D array known as an adjacency matrix is used to store connections between graph vertices. The...

本题提供 STAR 原则详细解答和技术解析，登录匠人学院学习中心即可查看完整答案。