Mathematics
The graph table
Draw a graph or load a real network, choose an algorithm and run it step by step, forwards or backwards. Change a weight or a direction and watch what moves.
Free, with your Voyelle account.
What leads here.
The decks that help you review what you handle here, and the learning path it belongs to.
The learning pathSolving a problem with a graphIts decks come in the right order, step by step, up to the badge.
The decks
- Vertices, edges, degrees
- Paths, cycles, connectivity
- Special graphs
- Adjacency matrix and adjacency lists
- Trees and spanning trees
- Kruskal's and Prim's algorithms
- Binary tree traversals
- Breadth-first search
- Depth-first search
- Connected components and topological sort
- Dijkstra's algorithm
- Bellman-Ford algorithm
- Floyd-Warshall algorithm
- PERT and MPM
- Gantt chart
- Graph colouring
- Maximum flow
- Assignment problem
- Transitive closure
- Eulerian and Hamiltonian graphs
In the same subject.
The plotter
Curves, tangents and matrices
The iteration workshop
Converge, oscillate, diverge
The numbers desk
Mean, median, spread
Try it, then review what it taught you.
Free: the whole library, unlimited reviews, no ads. See pricing