This repository was archived by the owner on Oct 21, 2021. It is now read-only.

Description
There are two implementation of graph implementations here.
One is by incidence list, second one is by adjacent list.
But, I think, this name is ambiguous.
Because I found "incidence list" on wikipedia which is redirected to "adjacent list"
Can somebody explain about why these implementations have these name?