Stack Exchange network consists of 183 Q&A communities including Stack Overflow, the largest, most trusted online community for developers to learn, share their knowledge, and build their careers.
Visit Stack Exchange
Stack Internal
Knowledge at work
Bring the best of human thought and AI automation together at your work.
Explore Stack Internal#CJam, 26 bytes
l~_,,:T.-_T\ff&Tf.e&.|:e_p Not very short...
###Explanation
l~ e# Read the input. _,,:T e# Get the graph size and store in T. .- e# Remove self-loops from the original input. _T\ff& e# Check if each vertex is in each list, and e# return truthy if yes, or empty list if no. Tf.e& e# Convert truthy to vertex numbers. .| e# Merge with the original graph. :e_ e# Remove empty lists. p e# Format and print. #CJam, 26 bytes
l~_,,:T.-_T\ff&Tf.e&.|:e_p Not very short...
###Explanation
l~ e# Read the input. _,,:T e# Get the graph size and store in T. .- e# Remove self-loops from the original input. _T\ff& e# Check if each vertex is in each list, and e# return truthy if yes, or empty list if no. Tf.e& e# Convert truthy to vertex numbers. .| e# Merge with the original graph. :e_ e# Remove empty lists. p e# Format and print. l~_,,:T.-_T\ff&Tf.e&.|:e_p Not very short...
l~ e# Read the input. _,,:T e# Get the graph size and store in T. .- e# Remove self-loops from the original input. _T\ff& e# Check if each vertex is in each list, and e# return truthy if yes, or empty list if no. Tf.e& e# Convert truthy to vertex numbers. .| e# Merge with the original graph. :e_ e# Remove empty lists. p e# Format and print. #CJam, 26 bytes
l~_,,:T.-_T\ff&Tf.e&.|:e_p Not very short...
###Explanation
l~ e# Read the input. _,,:T e# Get the graph size and store in T. .- e# Remove self-loops from the original input. _T\ff& e# Check if each vertex is in each list, and e# return truthy if yes, or empty list if no. Tf.e& e# Convert truthy to vertex numbers. .| e# Merge with the original graph. :e_ e# Remove empty lists. p e# Format and print. #CJam, 26 bytes
l~_,,:T.-_T\ff&Tf.e&.|:e_p Not very short...
#CJam, 26 bytes
l~_,,:T.-_T\ff&Tf.e&.|:e_p Not very short...
###Explanation
l~ e# Read the input. _,,:T e# Get the graph size and store in T. .- e# Remove self-loops from the original input. _T\ff& e# Check if each vertex is in each list, and e# return truthy if yes, or empty list if no. Tf.e& e# Convert truthy to vertex numbers. .| e# Merge with the original graph. :e_ e# Remove empty lists. p e# Format and print. #CJam, 26 bytes
l~_,,:T.-_T\ff&Tf.e&.|:e_p Not very short...