When poll is active respond at
PollEv.com​/pds
Send
pds
to
22333
In a directed graph with N nodes, if we assume any two nodes A and B can have at most one edge A--> B, then the maximum number of edges is
151
1%
1
O( log N )
21%
32
O ( N )
6%
9
O ( N log N )
2%
3
O ( 2*N )
70%
106
O ( N^2 )
0%
0
O ( 2^N )
See more
Powered by