File: root - text - article - 2019 - 10 - find-cycles-in-a-graph.txt
Tags: 每日算法题, 算法, 数据结构, 面试题, Daily Interview Problem, Data Structures and Algorithms, Computer Programming, | English | Home Page | Category: Computing | 619 Views, 23708 Search Bots | 72 Words
| Browse | Archive
Tags: 每日算法题, 算法, 数据结构, 面试题, Daily Interview Problem, Data Structures and Algorithms, Computer Programming, | English | Home Page | Category: Computing | 619 Views, 23708 Search Bots | 72 Words
| Browse | Archive
Hi, here's your problem today. This problem was recently asked by Facebook:
Given an undirected graph, determine if a cycle exists in the graph.
Here is a function signature:
Can you solve this in linear time, linear space?
Tags: 每日算法题, 算法, 数据结构, 面试题, Daily Interview Problem, Data Structures and Algorithms, Computer Programming, | English | Home Page | Cateogry: Computing | 619 Views, 23708 Search Bots | 72 Words Given an undirected graph, determine if a cycle exists in the graph.
Here is a function signature:
def find_cycle(graph):
# Fill this in.
graph = {
'a': {'a2':{}, 'a3':{} },
'b': {'b2':{}},
'c': {}
}
print find_cycle(graph)
# False
graph['c'] = graph
print find_cycle(graph)
# True
Can you solve this in linear time, linear space?
Related Articles
- Multitasking
- Spectrum Master
- New Vulnerabilities (CVE-2016-4581) have been detected in CentOS/RHEL/CloudLinux 7
- Daily Interview Problem: Running Median
- Generate All IP Addresses
- 56 Bytes
- Daily Interview Puzzle: Minimum Size Subarray Sum
- Daily Interview Problem: Look and Say Sequence
- Algorithm Interview: Convert Roman Numerals to Decimal
- Daily Interview Problem: Largest Product of 3 Elements I
©2006~2024 SteakOverCooked - 0.00737 Seconds(s) - 2453.59 KB/s - 33 Online Memory: 491.57 KB
18:54:01 up 13 days, 18:33, 2 users, load average: 0.98, 0.86, 0.73 - Server PHP Version: 7.4.33
How to Cook a Perfect Steak? | <meta name="robots" content="noindex, follow" />
18:54:01 up 13 days, 18:33, 2 users, load average: 0.98, 0.86, 0.73 - Server PHP Version: 7.4.33
Comments (0)
Read & Write - Normal - Mini - Post - All Comments - Statistics
Be the first one to comment this page !