Algorithmics 25
Search
Search
Dark mode
Light mode
Explorer
Python
NetworkX Cheatsheet
NetworkX Edges
NetworkX Nodes
Python Concepts
Unit 3
Abstract data types
Types
Array
Dictionary
List
Priority queue
Queue
Set
Stack
Abstract data type
Abstract data type signature
Data type
Non-primitive data type
Primitive data type
Algorithm design
Implementations
Graph-related algorithms
Path finding
Path finding
path finding
Shortest path
Bellman-Ford algorithm
Dijkstra's algorithm
Floyd-Warshall algorithm
Traversal
Best-first search
Breadth-first search
Breadth-first search (graphs)
Breadth-first search (trees)
Comparison between traversal algorithms
Depth-first search
Tree
Prim's Algorithm
Comparing Graph Algorithms
PageRank
Sorting Algorithms
Merge sort
Quick Sort
Sorting algorithms
Merge sort
Quick sort
Algorithm
Algorithm Design
Algorithm design
Algorithm Types
Algorithm types
Function
Proofs
Pseudocode
State diagram
Boolean algebra
Boolean Algebra
Boolean algebra
Conjunction (boolean algebra)
Disjunction (boolean algebra)
Logic statement
Negation (boolean algebra)
Properties of Equivalence
Truth table
Graph theory
Edge
Directed edge
Edge
Edge endpoints
Weighted edge
Graph Coloring
Graph coloring
Graph coloring
Graph coloring
Graph properties
Diameter (graph theory)
Distance (graph theory)
Graph representations
Adjacency list
Adjacency matrix
distance matrix
Incidence matrix
transitive closure
weight matrix
Graph travelling
Circuit
Cycle
Eulerian circuit
Eulerian trail
Hamiltonian cycle
Hamiltonian path
Negative weight cycle
Path
Trail
Walk
Graph types
Tree
Decision tree
Directed tree
Forest
Minimum spanning tree
Rooted tree
Spanning tree
Tree
Acyclic
Complete graph
Connected graph
Cyclic
Directed acyclic graph
Directed graph
Isomorphic Graph
Isomorphic graph
Labelled graph
Planar graph
Simple graph
Subgraph
Undirected graph
Weighted graph
Node
Adjacent nodes
Degree
Node
Source node
Target node
Weighted nodes
Topography
Isomorphism
Topography
Topological Sorting
Topological sorting
Applications of graph theory
Graph
Graph topology
Notation
Properties of Equivalence
Unit 4
Algorithm stuff
A(star) Search Algorithm
Binary search
Heuristics
Hill climbing
Simulated Annealing
Artificial Intelligence
Neural Networks
Forward Propagation
Model training
Multi-layer Perceptron Neural Networks
Overfitting and Underfitting
Structure
Ethics of AI
Searle's Chinese Room Argument
Support Vector Machines
Turing Test
Weak and Strong AI
Problems
0-1 Knapsack Problem
Entscheidungsproblem
Graph Coloring Problem
Halting Problem
Limits of Computability
Travelling Salesman Problem
Big-O Notation
Complexity Classes
Dynamic programming
Master Theorem
Turing Machine
About the authors
Study Design
Home
❯
Unit 3
❯
Graph theory
❯
Graph travelling
❯
Circuit
Circuit
Apr 28, 2025
1 min read
A
trail
(no repeated edges) that starts and ends at the same
node
.
Graph View
Backlinks
Trail
Tree
Algorithmics 25