te')); return $arr; } /* 遍历用户所有主题 * @param $uid 用户ID * @param int $page 页数 * @param int $pagesize 每页记录条数 * @param bool $desc 排序方式 TRUE降序 FALSE升序 * @param string $key 返回的数组用那一列的值作为 key * @param array $col 查询哪些列 */ function thread_tid_find_by_uid($uid, $page = 1, $pagesize = 1000, $desc = TRUE, $key = 'tid', $col = array()) { if (empty($uid)) return array(); $orderby = TRUE == $desc ? -1 : 1; $arr = thread_tid__find($cond = array('uid' => $uid), array('tid' => $orderby), $page, $pagesize, $key, $col); return $arr; } // 遍历栏目下tid 支持数组 $fid = array(1,2,3) function thread_tid_find_by_fid($fid, $page = 1, $pagesize = 1000, $desc = TRUE) { if (empty($fid)) return array(); $orderby = TRUE == $desc ? -1 : 1; $arr = thread_tid__find($cond = array('fid' => $fid), array('tid' => $orderby), $page, $pagesize, 'tid', array('tid', 'verify_date')); return $arr; } function thread_tid_delete($tid) { if (empty($tid)) return FALSE; $r = thread_tid__delete(array('tid' => $tid)); return $r; } function thread_tid_count() { $n = thread_tid__count(); return $n; } // 统计用户主题数 大数量下严谨使用非主键统计 function thread_uid_count($uid) { $n = thread_tid__count(array('uid' => $uid)); return $n; } // 统计栏目主题数 大数量下严谨使用非主键统计 function thread_fid_count($fid) { $n = thread_tid__count(array('fid' => $fid)); return $n; } ?>python - Representing Networkx graphs as strings in a consistent way - Stack Overflow
最新消息:雨落星辰是一个专注网站SEO优化、网站SEO诊断、搜索引擎研究、网络营销推广、网站策划运营及站长类的自媒体原创博客

python - Representing Networkx graphs as strings in a consistent way - Stack Overflow

programmeradmin5浏览0评论

I have multiple Networkx graphs (with node attributes), and I need to represent them as strings. There are several ways to do that, but I need to always get the same string for equal graphs (not isomorphic, by equal I mean that graphs_equal returns true). Is there a way to turn a graph into a string that guarantees this?

I have multiple Networkx graphs (with node attributes), and I need to represent them as strings. There are several ways to do that, but I need to always get the same string for equal graphs (not isomorphic, by equal I mean that graphs_equal returns true). Is there a way to turn a graph into a string that guarantees this?

Share Improve this question asked 2 days ago ThePirate42ThePirate42 8926 silver badges24 bronze badges
Add a comment  | 

1 Answer 1

Reset to default 0

I think the sort of thing done below should work.

import networkx as nx


def graph_to_str(g):
    return str(sorted(list(g.nodes.data()))), str(
        sorted(e if e[0] < e[1] else (e[1], e[0], e[2]) for e in list(g.edges.data()))
    )


g1 = nxplete_graph(4)
g2 = nx.Graph([(1, 2), (2, 3), (0, 1), (1, 3), (0, 2), (0, 3)])

for g in [g1, g2]:
    nx.set_node_attributes(g, {1: {"hello": "world"}})
    nx.set_edge_attributes(g, {(2, 3): {"foo": "bar"}})

print(nx.utils.graphs_equal(g1, g2), graph_to_str(g1) == graph_to_str(g2))  # True True

There may also be some other way explained in this documentation on reading/writing Networkx graphs.

发布评论

评论列表(0)

  1. 暂无评论