Using Networkx to Explore Pathfinding

MaxBezahler
In this talk we're going to cover using networkx to build a graph and then use various networkx algorithms to find characteristics about that path. We will cover:
- Introduction to Graphing and Pathfinding
- Where to find other materials including Pycon 2015 conference materials and websites with simulations
- Creating a graph, creating static layout, displaying nodes and edge value
- Using networkx for pathfinding specifically: dijkstra_path and astar_path
- We'll go thru the algorithm used for dijkstra and astar (A*)
- Quick discussion of new trends in path Finding: IDA*, theta* and phi* and Ant Colony Optimization algorithm
Slides and code *will* be available on Github