Help shape GoConqr. What should we add next?

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

Top Graph and Network Algorithms resources

Mind maps

Flashcards

Notes

Slides

More Discrete Mathematics, Graph Theory and Decision Maths topics

About Graph and Network Algorithms

GoConqr Original

Start 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.

Feedback

What is it about?

What should we add next?