Sign Up

Sign Up to our social questions and Answers Engine to ask questions, answer people’s questions, and connect with other people.

Have an account? Sign In

Have an account? Sign In Now

Sign In

Login to our social questions & Answers Engine to ask questions answer people’s questions & connect with other people.

Sign Up Here

Forgot Password?

Don't have account, Sign Up Here

Forgot Password

Lost your password? Please enter your email address. You will receive a link and will create a new password via email.

Have an account? Sign In Now

You must login to ask a question.

Forgot Password?

Need An Account, Sign Up Here

Please briefly explain why you feel this question should be reported.

Please briefly explain why you feel this answer should be reported.

Please briefly explain why you feel this user should be reported.

Sign InSign Up

The Archive Base

The Archive Base Logo The Archive Base Logo

The Archive Base Navigation

  • SEARCH
  • Home
  • About Us
  • Blog
  • Contact Us
Search
Ask A Question

Mobile menu

Close
Ask a Question
  • Home
  • Add group
  • Groups page
  • Feed
  • User Profile
  • Communities
  • Questions
    • New Questions
    • Trending Questions
    • Must read Questions
    • Hot Questions
  • Polls
  • Tags
  • Badges
  • Buy Points
  • Users
  • Help
  • Buy Theme
  • SEARCH
Home/ Questions/Q 7068383
In Process

The Archive Base Latest Questions

Editorial Team
  • 0
Editorial Team
Asked: May 28, 20262026-05-28T05:19:02+00:00 2026-05-28T05:19:02+00:00

I have a networkx graph. I am adding nodes by adding edges G.add_edge(route[i-1],route[i]); Now

  • 0

I have a networkx graph.
I am adding nodes by adding edges

G.add_edge(route[i-1],route[i]);

Now once the node is created by directly adding edges,
I add a list named

G.node[route[i]]['position'] = list()

and I append positions to it when I get same nodes again and again

G.node[route[i]]['position'].append( i - 3 )

Now when I want to append how do I check whether the list exist?
does doing

G.node[route[i]]['position'] = list()

clear the list of already existing elements?

edit—– my earlier question was confusing
I want to keep adding to the list
but I cant append unless a list exists, right?
So I have to do do
G.node[route[i]]['position'] = list() in my loop
So next time when I want to add to the same list in another loop instance how do I know that a list exists for G.node[route[i]]['position'] and I dont have to create it again.

edit—–
I think my list itself is a key here
so I did

                    if not 'position' in G.node[route[i]]:

and it works

  • 1 1 Answer
  • 0 Views
  • 0 Followers
  • 0
Share
  • Facebook
  • Report

Leave an answer
Cancel reply

You must login to add an answer.

Forgot Password?

Need An Account, Sign Up Here

1 Answer

  • Voted
  • Oldest
  • Recent
  • Random
  1. Editorial Team
    Editorial Team
    2026-05-28T05:19:02+00:00Added an answer on May 28, 2026 at 5:19 am

    G.node[route[i]]['position'] = list() will leave the slot G.node[route[i]]['position'] holding an empty list, but it will not affect the list that it previously held, which other objects may have a reference to.

    Instead, use: del l[:] to empty the list.

    If you want to have a list automatically created, use collections.defaultdict to have newly created entries default to a list.

    • 0
    • Reply
    • Share
      Share
      • Share on Facebook
      • Share on Twitter
      • Share on LinkedIn
      • Share on WhatsApp
      • Report

Sidebar

Related Questions

I have Directed Graph in networkx. I want to only keep those nodes which
I have a networkx graph which contains nodes whose positions in the graph are
Using Python's Networkx library, I created an undirected graph to represent a relationship network
I have a sea of weighted nodes with edges linking clusters of nodes together.
I'm working on some code for a directed graph in NetworkX, and have hit
Say I have a graph (network) of nodes, with weightings on the following: 1.
We currently have a dynamically updated network graph with around 1,500 nodes and 2,000
I need the edge end points from a graph. I have installed networkx. I
I have a weighted, directed graph which is dense with around 20,000 nodes. Given
I have a DirectShow graph to render MPEG2/4 movies from a network stream. When

Explore

  • Home
  • Add group
  • Groups page
  • Communities
  • Questions
    • New Questions
    • Trending Questions
    • Must read Questions
    • Hot Questions
  • Polls
  • Tags
  • Badges
  • Users
  • Help
  • SEARCH

Footer

© 2021 The Archive Base. All Rights Reserved
With Love by The Archive Base

Insert/edit link

Enter the destination URL

Or link to existing content

    No search term specified. Showing recent items. Search or use up and down arrow keys to select an item.