Introduction to the Modeling and Analysis of Complex Systems

306 CHAPTER 15. BASICS OF NETWORKSCompare these results with the commands we used above to check if the node/edgeadditions/removals were conducted correctly.Those nodes() and edges() are functions that read the raw data inside the Graphobject g and then produce a cleaned-up list of nodes or edges. But NetworkX also allowsyou to have direct access to the Graph object’s internal raw data structure. The data aboutnodes are stored in a dictionary called node right under g:Code 15.3:>>> g.node{’Jeff’: {}, ’Josh’: {}, ’Jess’: {}, ’Jill’: {}, ’Jack’: {}, ’Jane’: {}}This is a dictionary whose keys and values are the nodes’ names and their properties,respectively. The properties of each node are also stored in a dictionary (initially they areall empty, as shown above), so you can dynamically add or modify any node property asfollows:Code 15.4:>>> g.node[’Jeff’][’job’] = ’student’>>> g.node[’Jeff’][’age’] = 20>>> g.node[’Jeff’]{’job’: ’student’, ’age’: 20}We will use this method to add dynamic states to the nodes in Section 16.2.Similarly, the data about the edges are also stored in a dictionary called edge underg:Code 15.5:>>> g.edge{’Jeff’: {’Jane’: {}, ’Jill’: {}}, ’Josh’: {’Jess’: {}}, ’Jess’: {’Jill’:{}, ’Josh’: {}}, ’Jill’: {’Jess’: {}, ’Jeff’: {}}, ’Jack’: {’Jane’: {}},’Jane’: {’Jack’: {}, ’Jeff’: {}}}This is a little hard to read, so let me insert line breaks at the appropriate places so thatthe structure of the data is clearer:Code 15.6:{’Jeff’: {’Jane’: {}, ’Jill’: {}},’Josh’: {’Jess’: {}},