Skip to content
/ Parade Public

Solution for problem for Graph Algorithms course at AGH UST

0 stars 0 forks Branches Tags Activity
Star
Notifications You must be signed in to change notification settings

lkwinta/Parade

BranchesTags

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

3 Commits
graphs
graphs
 
 
.gitignore
.gitignore
 
 
README.md
README.md
 
 
data.py
data.py
 
 
dimacs.py
dimacs.py
 
 
example.py
example.py
 
 
solution.py
solution.py
 
 
testy.py
testy.py
 
 

Repository files navigation

Project for Graph Alogrithms problem

Solves problem of finding shortest path with max count of points that are traversed between two biconnected components in $\mathcal{O} (EV \log V)$ time complexity

About

Solution for problem for Graph Algorithms course at AGH UST

Topics

python graphs dijkstra-algorithm biconnected-components articulation-point

Resources

Readme
Activity

Stars

0 stars

Watchers

1 watching

Forks

0 forks
Report repository

Languages