You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
{{ message }}
Instantly share code, notes, and snippets.
YUKE WANG
YukeWang96
Incoming Assistant Professor at Rice CS | Ph.D. at the University of California, Santa Barbara | System/Compiler for Deep Learning
This program takes the input graph as an edge list, and outputs an equivalent graph in which index vertices are minimized. In other words, it converts input graph's vertex indices to non-negative numbers so that if there exists an index a>0, and 0<=b<a, there will exist index b in the list of edges as a source and/or destination vertex.
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters