[Date Prev] | [Thread Prev] | [Thread Next] | [Date Next] -- [Date Index] | [Thread Index] | [List Home]
Subject: RE: [sarif] Another graph design issue: minimum number of nodes and edges
Let’s go ahead and permit both an empty graph and a graph of a single node. I cannot think of a practical use for this. But in general, you don’t want to create a design situation when ‘empty’ conditions can’t be explicitly defined, so would prefer not to do so here without a clear reason to forbid it.
Get Outlook for iOS
From: email@example.com <firstname.lastname@example.org> on behalf of Larry Golding (Comcast) <email@example.com>
Ping on this design question.
Does a graph have to have any nodes, or any edges? Is it sensible for an empty graph to describe a portion of the program that turns out to be empty? Like, “There aren’t any functions that call function foo” (it’s dead code).