answersLogoWhite

0

"An edge is light edge crossing the cut if its weight is minimum of any edge crossing the cut"

So lets say you have a graph G = (V, E), and you partition the vertices in V into to sets A and B= V-A (neither A or B are empty sets). Then the light edges (u, v) in E where either u or v is in A and the other is in B, and where none of the other edges in E that fill this criteria have a shorter weight.

User Avatar

Wiki User

9y ago

Still curious? Ask our experts.

Chat with our AI personalities

DevinDevin
I've poured enough drinks to know that people don't always want advice—they just want to talk.
Chat with Devin
JudyJudy
Simplicity is my specialty.
Chat with Judy
BlakeBlake
As your older brother, I've been where you are—maybe not exactly, but close enough.
Chat with Blake

Add your answer:

Earn +20 pts
Q: Definition of light edge in graph?
Write your answer...
Submit
Still have questions?
magnify glass
imp