代码搜索:CONNECTED 有哪些应用?

找到约 10,000 项符合「CONNECTED 有哪些应用?」的源代码

代码结果 10,000
www.eeworm.com/read/168845/5432627

cpp connected_components.cpp

//======================================================================= // Copyright 1997, 1998, 1999, 2000 University of Notre Dame. // Authors: Andrew Lumsdaine, Lie-Quan Lee, Jeremy G. Siek //
www.eeworm.com/read/168845/5432710

expected connected_components.expected

Total number of components: 3 Vertex 0 is in component 0 Vertex 1 is in component 0 Vertex 2 is in component 1 Vertex 3 is in component 2 Vertex 4 is in component 0 Vertex 5 is in component 1
www.eeworm.com/read/168845/5432779

cpp connected-components.cpp

//======================================================================= // Copyright 2001 Jeremy G. Siek, Andrew Lumsdaine, Lie-Quan Lee, // // Distributed under the Boost Software License, Vers
www.eeworm.com/read/332241/3400950

c connected-peer.c

/* connected-peer.c * * Copyright (c) 2000 Sean Walton and Macmillan Publishers. Use may be in * whole or in part in accordance to the General Public License (GPL). * * THIS SOFTWARE IS PRO
www.eeworm.com/read/309223/3706390

xpm connected.ico.xpm

/* XPM */ static char *connected.ICO[] = { /* columns rows colors chars-per-pixel */ "16 16 117 2", " c black", ". c #00182D", "X c #001E31", "o c #00203A", "O c #002343", "+ c #00254A", "@ c
www.eeworm.com/read/304962/3782528

h connected_components.h

// Copyright (c) 2006 Foundation for Research and Technology-Hellas (Greece). // All rights reserved. // // This file is part of CGAL (www.cgal.org); you may redistribute it under // the terms of the
www.eeworm.com/read/304657/3788326

java connected_objects.java

/* Connected_objects.java -- Copyright (C) 2005 Free Software Foundation, Inc. This file is part of GNU Classpath. GNU Classpath is free software; you can redistribute it and/or modify it under t
www.eeworm.com/read/273525/4208396

style yxtype-connected.style

*! version 1.0.0 22dec2002 sequence 1200
www.eeworm.com/read/273525/4209721

hlp twoway_connected.hlp

{smcl} {* 08apr2005}{...} {cmd:help twoway connected} {right:dialog: {dialog econnected:easy connected graph}} {right:{dialog twoway_overlay:overlaid twoway}{space 5}} {right:{dialog twoway_sim
www.eeworm.com/read/396844/2407097

m connected_graph.m

function b = connected(adj_mat, directed) % % b = connected(adj_mat). % Returns true iff the graph is connected. n = length(adj_mat); start = 1; [d, pre] = dfs(adj_mat, start, directed); b = (length(