Compares two GraphDef protos for equality, ignoring versions and ordering of
nodes, attrs, and control inputs. Node names are used to match up nodes
between the graphs, so the naming of nodes must be consistent.
Args
actual
The GraphDef we have.
expected
The GraphDef we expected.
checkpoint_v2
boolean determining whether to ignore randomized attribute
values that appear in V2 checkpoints.
hash_table_shared_name
boolean determining whether to ignore randomized
shared_names that appear in HashTableV2 op defs.
[[["Easy to understand","easyToUnderstand","thumb-up"],["Solved my problem","solvedMyProblem","thumb-up"],["Other","otherUp","thumb-up"]],[["Missing the information I need","missingTheInformationINeed","thumb-down"],["Too complicated / too many steps","tooComplicatedTooManySteps","thumb-down"],["Out of date","outOfDate","thumb-down"],["Samples / code issue","samplesCodeIssue","thumb-down"],["Other","otherDown","thumb-down"]],["Last updated 2024-01-23 UTC."],[],[]]