|
l109-tutorial 2015
Document Outline - Slide 1
- Outline
- 1. Introduction to NetworkX
- Introduction: networks are everywhere…
- Introduction: why Python?
- Introduction: Python’s Holy Trinity
- Introduction: NetworkX
- Introduction: when to use NetworkX
- Introduction: a quick example
- Introduction: drawing and plotting
- Introduction: NetworkX official website
- 2. Getting started with Python and NetworkX
- Getting started: the environment
- Getting started: adding nodes
- Getting started: node objects
- Getting started: adding edges
- Getting started: accessing nodes and edges
- Getting started: Python dictionaries
- Getting started: graph attributes
- Getting started: node and edge iterators
- Getting started: directed graphs
- Getting started: graph operators
- Getting started: graph generators
- Getting started: graph input/output
- Getting started: drawing graphs
- 3. Basic network analysis
- Basic analysis: the Cambridge place network
- Basic analysis: graph properties
- Basic analysis: degree distribution
- Basic analysis: degree distribution
- Basic analysis: degree distribution
- Basic analysis: clustering coefficient
- Basic analysis: node centralities
- Basic analysis: most central nodes
- Basic analysis: interpretability
- Basic analysis: most central nodes
- Basic analysis: drawing our network
- Basic analysis: working with JSON data
- 4. Writing your own code
- Writing your own code: BFS
- Writing your own code: network triads
- Writing your own code: average neighbours’ degree
- 5. Ready for your own analysis!
- What you have learnt today
- Useful links
- Questions?
Dostları ilə paylaş: |
|
|