aboutsummaryrefslogtreecommitdiffhomepage
path: root/tensorflow/tensorboard/components/tf-graph-common/lib/common.ts
diff options
context:
space:
mode:
authorGravatar A. Unique TensorFlower <nobody@tensorflow.org>2016-01-05 14:05:27 -0800
committerGravatar Vijay Vasudevan <vrv@google.com>2016-01-05 14:05:27 -0800
commit1c579361cd1e088dd5e05a394b1561a73e3667ba (patch)
treeec464b9ac18113dc052744b6714eebbc7c6cc34d /tensorflow/tensorboard/components/tf-graph-common/lib/common.ts
parent208350a6092f9faa473daf8b6eb6a80e9f9518f1 (diff)
Added 'logging' import to control_flow_ops which is used in the file but not imported.
Change: 110842260
Diffstat (limited to 'tensorflow/tensorboard/components/tf-graph-common/lib/common.ts')
-rw-r--r--tensorflow/tensorboard/components/tf-graph-common/lib/common.ts13
1 files changed, 9 insertions, 4 deletions
diff --git a/tensorflow/tensorboard/components/tf-graph-common/lib/common.ts b/tensorflow/tensorboard/components/tf-graph-common/lib/common.ts
index 17b753a2f9..66ed9fc84a 100644
--- a/tensorflow/tensorboard/components/tf-graph-common/lib/common.ts
+++ b/tensorflow/tensorboard/components/tf-graph-common/lib/common.ts
@@ -18,17 +18,19 @@ limitations under the License.
declare module graphlib {
interface GraphOptions {
- name: string;
+ name?: string;
/**
* Direction for rank nodes. Can be TB, BT, LR, or RL, where T = top,
* B = bottom, L = left, and R = right.
*/
- rankdir: string;
- type: string|number;
+ rankdir?: string;
+ type?: string|number;
/** Number of pixels between each rank in the layout. */
ranksep?: number;
/** Number of pixels that separate nodes horizontally in the layout. */
nodesep?: number;
+ /** Number of pixels that separate edges horizontally in the layout */
+ edgesep?: number;
}
export interface EdgeObject {
@@ -58,7 +60,10 @@ declare module graphlib {
edges(): EdgeObject[];
outEdges(name: string): E[];
inEdges(name: string): E[];
- /** Returns those nodes in the graph that have no in-edges. Takes O(|V|) time. */
+ /**
+ * Returns those nodes in the graph that have no in-edges.
+ * Takes O(|V|) time.
+ */
sources(): string[];
/**
* Remove the node with the id v in the graph or do nothing if