Category:Graph algorithms

This category is being considered for speedy renaming to Category:Graph algorithms in accordance with Wikipedia's category discussion policy. Any pages in this category will be recategorized (not deleted).

If you disagree with its speedy renaming, please explain at this category's entry on the speedy section of the Categories for discussion page.

Please do not empty the category or remove this notice while the discussion is in progress.

Add entry * [[:Category:Graph algorithms]] to [[:Category:Graph algorithms]] – Reason ~~~~

Administrators: Once the category has been copied to the new name and emptied, click here to delete.

Graph algorithms solve problems related to graph theory.

Subcategories

This category has the following 3 subcategories, out of 3 total.

F

Flooding algorithms (5 P)

G

Graph drawing (3 C, 36 P)
Graph rewriting (11 P)

Pages in category "Graph algorithms"

The following 136 pages are in this category, out of 136 total. This list may not reflect recent changes.

*

Hub labels

A

B

C

D

E

F

G

H

I

J

K

L

M

N

P

R

S

T

W

Y

Yen's algorithm

Z

Zero-weight cycle problem