Skip to content

Navigation Menu

Sign in
Appearance settings

Search code, repositories, users, issues, pull requests...

Provide feedback

We read every piece of feedback, and take your input very seriously.

Saved searches

Use saved searches to filter your results more quickly

Sign up
Appearance settings

bbvch13531/algorithm

Folders and files

NameName
Last commit message
Last commit date

Latest commit

History

64 Commits
a
a

Repository files navigation

algorithm

StudyLog

0914 - priority_queue

MST, LCA풀기위해서 pq를 이용하려고 함. cmp 함수를 이용하기 위해서는


struct cmp{
	bool operator()(Edge a, Edge b){
		return a.w > b.w;
	}
};
priority_queue <Edge, vector<Edge>, cmp> edgeVec;

위와 같은 식으로 선언해야함.

Vector의 cmp는 struct 를 안만들어도 되는걸로 알고있음.

오랜만에 알고리즘 공부하면서 나중에 다시 볼 때 이해할 수 있는 문서를 만드는게 목표!

About

No description, website, or topics provided.

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

Contributors

AltStyle によって変換されたページ (->オリジナル) /