当前位置: 首页>>代码示例>>TypeScript>>正文


TypeScript json.write方法代码示例

本文整理汇总了TypeScript中graphlib.json.write方法的典型用法代码示例。如果您正苦于以下问题:TypeScript json.write方法的具体用法?TypeScript json.write怎么用?TypeScript json.write使用的例子?那么恭喜您, 这里精选的方法代码示例或许可以为您提供帮助。您也可以进一步了解该方法所在graphlib.json的用法示例。


在下文中一共展示了json.write方法的3个代码示例,这些例子默认根据受欢迎程度排序。您可以为喜欢或者感觉有用的代码点赞,您的评价将有助于系统推荐出更棒的TypeScript代码示例。

示例1: test_graph

function test_graph() {
  var g = new graphlib.Graph({
    compound: true,
    directed: true,
    multigraph: true
  });
  g.setEdge('a', 'b');
  g.setEdge('a', 'b', 1.023, 'test');
  g.setEdge({ v: 'a', w: 'b', name: 'test' }, 1.023);
  g.hasEdge('a', 'b', 'test');
  g.hasEdge({ v: 'a', w: 'b', name: 'test' });
  g.removeEdge('a', 'b', 'test');
  g.removeEdge({ v: 'a', w: 'b', name: 'test' });

  g.edge('a', 'b', 'test');
  g.edge({v: 'a', w: 'b', name: 'test'});
  g.setDefaultNodeLabel({});
  g.setDefaultNodeLabel(() => 42);
  g.setDefaultEdgeLabel({});
  g.setDefaultEdgeLabel(() => 'e42');
  g.setNodes(['a', 'b', 'c'], 42);
  g.setParent('d', 'a');
  g.setParent('d');
  g.parent('d');
  g.children('a');
  g.filterNodes(v => true);
  g.setPath(['a', 'b', 'c'], 42);

  graphlib.json.read(graphlib.json.write(g));

  graphlib.alg.dijkstra(g, 'a', e => g.edge(e));
  graphlib.alg.dijkstraAll(g, e => g.edge(e));
  graphlib.alg.dijkstraAll(g);

  graphlib.alg.findCycles(g);
  graphlib.alg.isAcyclic(g);
  graphlib.alg.prim(g, e => g.edge(e));
  graphlib.alg.tarjan(g);
  graphlib.alg.topsort(g);
  graphlib.alg.preorder(g, g.nodes());
  graphlib.alg.postorder(g, g.nodes());
}
开发者ID:AbraaoAlves,项目名称:DefinitelyTyped,代码行数:42,代码来源:graphlib-tests.ts

示例2: test_graph

function test_graph() {
  var g = new graphlib.Graph();
  g.setEdge('a', 'b');
  g.setEdge('a', 'b', 1.023);

  g.edge('a', 'b');
  g.edge({v: 'a', w: 'b'});

  graphlib.json.read(graphlib.json.write(g));

  graphlib.alg.dijkstra(g, 'a', e => g.edge(e));
  graphlib.alg.dijkstraAll(g, e => g.edge(e));
  graphlib.alg.dijkstraAll(g);

  graphlib.alg.findCycles(g);
  graphlib.alg.isAcyclic(g);
  graphlib.alg.prim(g, e => g.edge(e));
  graphlib.alg.tarjan(g);
  graphlib.alg.topsort(g);
}
开发者ID:HawkHouseIntegration,项目名称:DefinitelyTyped,代码行数:20,代码来源:graphlib-tests.ts

示例3: fromSchemas

    static fromSchemas(dependencies : Array<model.Dependency>, jobs : Array<model.BuildSchema>) : PipelineGraph {

        let options = { directed: true, compound: false, multigraph: false };
        let graph : Graphlib.Graph<model.BuildSchema, void> = new Graphlib.Graph(options);

        jobs.forEach((job : model.BuildSchema) => {
            graph.setNode(job._id, job);
        });

        let jobsByRepo : Map<string, model.BuildSchema> = new Map();
        jobs.forEach(job => jobsByRepo.set(job.repo, job));

        dependencies.forEach((dependency : model.Dependency) => {
            if(jobsByRepo.has(dependency.up) && jobsByRepo.has(dependency.down)) {
                graph.setEdge(jobsByRepo.get(dependency.up)._id, jobsByRepo.get(dependency.down)._id);
            }
        });

        if(!Graphlib.alg.isAcyclic(graph)) {
            throw new Error('pipeline graph contains circular dependencies:' + JSON.stringify(Graphlib.json.write(graph)));
        }

        if(graph.sources().length > 1) {
            throw new Error('pipeline graph has more than one source nodes: ' + JSON.stringify(Graphlib.json.write(graph)));
        }

        let pipelineGraph = new PipelineGraph();
        pipelineGraph._graph = graph;
        pipelineGraph._dependencies = dependencies;
        pipelineGraph._builds = jobs;

        return pipelineGraph;

    }
开发者ID:mserranom,项目名称:lean-ci,代码行数:34,代码来源:PipelineGraph.ts


注:本文中的graphlib.json.write方法示例由纯净天空整理自Github/MSDocs等开源代码及文档管理平台,相关代码片段筛选自各路编程大神贡献的开源项目,源码版权归原作者所有,传播和使用请参考对应项目的License;未经允许,请勿转载。