Problems

1 – 14 of 14

Problem Title Likes Solvers Difficulty

Problem 2730. Graph Algorithms 3: Number of Connected Components

Created by: rifat

Tags graph theory, graph, adjacency matrix

Problem 1169. Count the Number of Directed Cycles in a Graph

Created by: Joseph Kirk

Tags graph theory, cycles, directed graphs

Problem 1170. Count the Number of Undirected Cycles in a Graph

Created by: Joseph Kirk

Tags graph theory, cycles, undirected graphs

Problem 2372. Determine connected components of a graph

Created by: rifat

Tags graph theory

Problem 475. Is this group simply connected?

Created by: Ned Gulley

Tags graph theory

Problem 458. Parcel Routing

Created by: @bmtran (Bryant Tran)

Tags graph theory, shortest path, ups

Problem 2461. Graph Algorithms - 2 : Chromatic Number

Created by: rifat

Tags graph theory

Problem 2458. Graph Algorithms - 1 : Length of the largest closed path

Created by: rifat

Tags graph theory

Problem 283. Give the Shortest Path Through The Maze

Created by: @bmtran (Bryant Tran)

Tags maze, solving, graph theory

Problem 44378. Five-dimensional maze

Created by: @bmtran (Bryant Tran)

Tags maze, graph theory, multidimensional

Problem 2732. Construct a precedence graph from a code segment

Created by: rifat

Tags graph theory, precedence, graphs

1 – 14 of 14

Difficulty Rating

Problem Groups

Problems

Problem 2730. Graph Algorithms 3: Number of Connected Components

Problem 1169. Count the Number of Directed Cycles in a Graph

Problem 1170. Count the Number of Undirected Cycles in a Graph

Problem 2372. Determine connected components of a graph

Problem 475. Is this group simply connected?

Problem 458. Parcel Routing

Problem 2461. Graph Algorithms - 2 : Chromatic Number

Problem 2458. Graph Algorithms - 1 : Length of the largest closed path

Problem 283. Give the Shortest Path Through The Maze

Problem 44378. Five-dimensional maze

Problem 2732. Construct a precedence graph from a code segment

Problem 1886. Graceful Double Wheel Graph

Problem 2646. Determine the number of maximal cliques in an undirected graph

Problem 2647. Find the maximal cliques in an undirected graph