Graph and Network Algorithms
23 resources created by 22 users
This Graph and Network Algorithms page on GoConqr gathers community-made flashcards, mind maps and notes, from graph terms and algorithm steps to critical path analysis. It is for school students practicing these ideas and teachers looking for ready-made material. The page has over 20 resources, with material mainly at secondary-school level. Choose a resource to start exploring the topic.
Graph and Network Algorithms
- All Discrete Mathematics, Graph Theory and Decision Maths resources
- Logic, Proofs and Boolean Algebra6
- Sets, Relations and Functions17
- Combinatorics and Recurrence Relations5
- Sorting, Searching and Bin Packing Algorithms6
- Graph Terminology and Types36
- Graph Paths, Cycles and Route Problems11
- Planar Graphs and Graph Coloring5
- Trees and Minimum Spanning Trees9
- Linear Programming15
- Constrained Optimization and Lagrange Multipliers6
- Game Theory13
Top Graph and Network Algorithms resources
-
13 cardsCritical path analysis What is a precedence table?
-
51 cardsDecision key points
-
44 cardsDecision 1 What is the bubble sort algorithm?
-
21 cardsD1 Networks MINIMUM SPANNING TREES?
-
66 nodesD1 Revision Graphs and Networks · Algorithms · Linear Programming
-
31 cardsDecision 1 An flashcard overview of the AQA Decision Maths 1 topics
-
27 cardsD1 Definitions Definitions for Decision 1 Edexcel Maths
-
85 nodesD1 Maths Minimum Connectors · Travelling Salesperso... · Packing Algorithm · Flow Charts · Linear Programming · Route Inspection/Chin...
Mind maps
-
66 nodesD1 Revision Graphs and Networks · Algorithms · Linear Programming
-
85 nodesD1 Maths Minimum Connectors · Travelling Salesperso... · Packing Algorithm · Flow Charts · Linear Programming · Route Inspection/Chin...
-
60 nodesDecision 1_1 Kruscals Algorithm · Prims Algorithm · Dijkstras Algorithm · Bipartite Graph · Chinese Postman · Travelling Salesman
-
60 nodesDecision 1 Kruscals Algorithm · Prims Algorithm · Dijkstras Algorithm · Bipartite Graph · Chinese Postman · Travelling Salesman
-
39 nodesMathematics: Decision 1 Algorithms · Graph Theory · Networks · Linear Programming
Flashcards
-
13 cardsCritical path analysis What is a precedence table?
-
51 cardsDecision key points
-
44 cardsDecision 1 What is the bubble sort algorithm?
-
21 cardsD1 Networks MINIMUM SPANNING TREES?
-
31 cardsDecision 1 An flashcard overview of the AQA Decision Maths 1 topics
-
27 cardsD1 Definitions Definitions for Decision 1 Edexcel Maths
-
26 cardsD1 Keywords
-
22 cardsUse of Maths Key Ideas An flashcard overview of the Use of maths decision topics
Notes
-
Summary of Chapter 5 1 A complex project may be broken down into a number of separate activities. The completion of an activity is described as an event.2 Some activities may only be started once other activities are completed. This ...
-
Chapter Notes[3] Ch 10 - Matching MarketsStable Marriages Given a set of n males and m females we wish to find a matching of men and women that is at least pareto optimal i.e. stable meaning that no women or man would have the in...
Slides
More Discrete Mathematics, Graph Theory and Decision Maths topics
About Graph and Network Algorithms
GoConqr OriginalStart with graph language
The flashcards in Use of Maths Key Ideas introduce terms such as simple graphs, connected graphs and cycles. They also mention Dijkstra's, Prim's and Kruskal's algorithms. Start by studying the graph terms, then return to the cards on algorithms as you work through the topic.
For a visual overview, the Mathematics: Decision 1 mind map includes algorithms, flow diagrams and sorting. Use it to see how the terms you encounter fit alongside the algorithm material on this page.
Follow the algorithm steps
The Decision 1 mind map sets out steps for Kruskal's algorithm, including listing edges from smallest to biggest and adding edges without creating cycles. It also includes Prim's algorithm. Read the map alongside the graph terms in Use of Maths Key Ideas, checking that you recognize the words used in each description.
The Decision 1 flashcards on simple graphs also cover Dijkstra's, Prim's and Kruskal's algorithms. Use the cards to recall an algorithm, then return to the mind map to review the steps it shows.
Explore critical path analysis
The Critical path analysis flashcards ask about precedence tables, activity networks and immediate predecessors. The notes on project activities and events offer another place to study related ideas, including activities that can only start after others.
Read the notes first for context, then use the flashcard questions to check your recall. Go back to the notes when a term needs another look.
Use this section of the unit
Graph and Network Algorithms is a section of the Discrete Mathematics, Graph Theory and Decision Maths unit in Mathematics. The page brings its resources together in different formats, so you can move between a visual overview, definitions and questions. There are no quizzes listed here; the flashcards provide questions to work through instead.
Pick a mind map and a flashcard deck to study side by side.
Frequently asked questions
Which resource should I start with?
Try the Use of Maths Key Ideas flashcards if you want to begin with graph terms. They cover simple graphs, connected graphs and cycles as well as named algorithms. For critical path analysis, start with the notes on project activities and events, then use the Critical path analysis flashcards to work through questions.
What do the mind maps cover?
The mind maps offer visual material on algorithms and networks. Mathematics: Decision 1 includes flow diagrams, sorting and algorithms. The Decision 1 mind map sets out steps for Kruskal's algorithm and also covers Prim's algorithm. You can use a map alongside the flashcards to connect definitions with the steps described.
Are these resources free to use?
Yes. Every resource listed on this page is free to open and study without an account. A free account also lets you save quiz scores and make your own quizzes, mind maps, flashcards and notes. The listed resources were made by GoConqr users, rather than by GoConqr.