自定义博客皮肤VIP专享

*博客头图:

格式为PNG、JPG,宽度*高度大于1920*100像素,不超过2MB,主视觉建议放在右侧,请参照线上博客头图

请上传大于1920*100像素的图片!

博客底图:

图片格式为PNG、JPG,不超过1MB,可上下左右平铺至整个背景

栏目图:

图片格式为PNG、JPG,图片宽度*高度为300*38像素,不超过0.5MB

主标题颜色:

RGB颜色,例如:#AFAFAF

Hover:

RGB颜色,例如:#AFAFAF

副标题颜色:

RGB颜色,例如:#AFAFAF

自定义博客皮肤

-+

KusanoNEU的博客

No day but today.

  • 博客(8)
  • 收藏
  • 关注

原创 vertex disjoint paths with ford-fulkerson algorithm

// // main.cpp // vertex disjoint path // // Created by Longxiang Lyu on 8/15/16. // Copyright © 2016 Longxiang Lyu. All rights reserved. // the method can be found at: // https://courses.engr.i

2016-08-16 09:51:43 650

原创 Edge disjoint paths with Ford-Fulkerson algorithm

// // main.cpp // Edge Disjoint paths // // Created by Longxiang Lyu on 8/15/16. // Copyright © 2016 Longxiang Lyu. All rights reserved. // #include #include #include #include #include #incl

2016-08-16 08:46:14 1443

原创 Find minimum cut

// // main.cpp // MinCut // // Created by Longxiang Lyu on 8/15/16. // Copyright © 2016 Longxiang Lyu. All rights reserved. // steps to find min-cut // 1. run ford-fulkerson and consider final r

2016-08-16 07:26:51 356

原创 Max bipartite matching with Ford-Fulkerson algorithm

// // main.cpp // Bipartite matching // // Created by Longxiang Lyu on 8/15/16. // Copyright © 2016 Longxiang Lyu. All rights reserved. // // max cardinality matching can be solved by max-flow //

2016-08-16 06:49:21 577

原创 Dinic Algorithm to solve max flow problem

// // main.cpp // Dinic // // Created by Longxiang Lyu on 8/12/16. // Copyright © 2016 Longxiang Lyu. All rights reserved. // // reference: // https://sites.google.com/site/indy256/algo_cpp/dinic_

2016-08-13 04:40:43 579

原创 Ford-Fulkerson algorithm with capacity scaling

// // main.cpp // Ford-Fulkerson with capacity scaling // // Created by Longxiang Lyu on 8/9/16. // Copyright (c) 2016 Longxiang Lyu. All rights reserved. // #include #include #include #includ

2016-08-11 05:58:47 770

原创 Ford-Fulkerson algorithm to solve the max flow problem

// // main.cpp // Ford-Fulkerson // // Created by Longxiang Lyu on 8/9/16. // Copyright (c) 2016 Longxiang Lyu. All rights reserved. // #include #include #include #include using namespace st

2016-08-10 10:57:06 617

原创 Bellman-ford algorithm to find the shortest path

// // main.cpp // Demo // // Created by Longxiang Lyu on 8/9/16. // Copyright (c) 2016 Longxiang Lyu. All rights reserved. // #include #include #include #include #include class Edge; class

2016-08-10 10:15:49 743

空空如也

空空如也

TA创建的收藏夹 TA关注的收藏夹

TA关注的人

提示
确定要删除当前文章?
取消 删除