Before you keep reading...

Runestone Academy can only continue if we get support from individuals like you. As a student you are well aware of the high cost of textbooks. Our mission is to provide great books to you for free, but we ask that you consider a $10 donation, more if you can or less if $10 is a burden.

Support Runestone Academy Today

4.13. Self Check

A Graphical represention of a Friend Network

Q-1: Based on the graph above what social media platform would the user be using?

• Instagram
• This is incorrect due to the graph not being directed.
• Twitter
• This is incorrect due to the graph not being directed.
• Reddit
• This is incorrect due to the graph not being directed.
• Facebook
• Correct, because the Graph is undirected.

Q-2: Match the correct NetworkX code piece to the correct description.
• G
• This variable is a DiGraph object that contains no nodes and no edges.
• add_node
• This method adds nodes.
• nodes
• This method gets a list of nodes.
• Nodeview
• This class can be used in a for loop or it can make a list.
• Edges
• This method gets a list of edges.
• Draw_circular
• This method arranges the nodes in a circle and connects them with edges.

Before you keep reading...

Making great stuff takes time and $$. If you appreciate the book you are reading now and want to keep quality materials free for other students please consider a donation to Runestone Academy. We ask that you consider a $10 donation, but if you can give more thats great, if $10 is too much for your budget we would be happy with whatever you can afford as a show of support.

Support Runestone Academy Today

Please construct def complete_graph:

        def make_complete_graph(n):
---
    G = nx.Graph()
    ---
    nodes = range(n)
    ---
    G.add_nodes_from(nodes)
    ---
    G.add_edges_from(all_pairs(nodes))
    ---
    return G
        

You have attempted 1 of 5 activities on this page